./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/sqrt1-ll_unwindbound10.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 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:03:19,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:03:19,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:03:19,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:03:19,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:03:19,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:03:19,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:03:19,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:03:19,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:03:19,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:03:19,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:03:19,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:03:19,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:03:19,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:03:19,717 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:03:19,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:03:19,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:03:19,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:03:19,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:03:19,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:03:19,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:03:19,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:03:19,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:03:19,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:03:19,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:03:19,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:03:19,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:03:19,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:03:19,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:03:19,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:03:19,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:03:19,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:03:19,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:19,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:03:19,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:03:19,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:03:19,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:03:19,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:03:19,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:03:19,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:03:19,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:03:19,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:03:19,726 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 -> 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:03:19,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:03:19,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:03:19,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:03:19,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:03:19,979 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:03:19,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-09-25 00:03:21,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:03:21,594 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:03:21,594 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-09-25 00:03:21,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a5a1b49f7/8c09ee5f31f2472a9cd413bc94373c07/FLAG7b1200043 [2024-09-25 00:03:21,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a5a1b49f7/8c09ee5f31f2472a9cd413bc94373c07 [2024-09-25 00:03:22,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:03:22,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:03:22,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:22,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:03:22,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:03:22,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515761c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22, skipping insertion in model container [2024-09-25 00:03:22,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:03:22,176 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c[520,533] [2024-09-25 00:03:22,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:22,199 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:03:22,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c[520,533] [2024-09-25 00:03:22,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:22,226 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:03:22,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22 WrapperNode [2024-09-25 00:03:22,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:22,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:22,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:03:22,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:03:22,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,245 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:03:22,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:22,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:03:22,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:03:22,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:03:22,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,266 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-25 00:03:22,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:03:22,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:03:22,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:03:22,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:03:22,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (1/1) ... [2024-09-25 00:03:22,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:22,355 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-25 00:03:22,358 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-25 00:03:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:03:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:03:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:03:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:03:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:03:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:03:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:03:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:03:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:03:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:03:22,472 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:03:22,474 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:03:22,657 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:03:22,657 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:03:22,691 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:03:22,692 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:03:22,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:22 BoogieIcfgContainer [2024-09-25 00:03:22,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:03:22,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:03:22,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:03:22,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:03:22,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:03:22" (1/3) ... [2024-09-25 00:03:22,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d8956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:22, skipping insertion in model container [2024-09-25 00:03:22,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:22" (2/3) ... [2024-09-25 00:03:22,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d8956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:22, skipping insertion in model container [2024-09-25 00:03:22,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:22" (3/3) ... [2024-09-25 00:03:22,703 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2024-09-25 00:03:22,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:03:22,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:03:22,780 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:03:22,786 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;@60c6f988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:03:22,787 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:03:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:03:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 00:03:22,797 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:22,797 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:22,798 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:22,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash -97680429, now seen corresponding path program 1 times [2024-09-25 00:03:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633052996] [2024-09-25 00:03:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:22,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:03:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633052996] [2024-09-25 00:03:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633052996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:22,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:03:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750976935] [2024-09-25 00:03:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:22,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:03:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:03:23,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:23,026 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:23,107 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2024-09-25 00:03:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:03:23,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 00:03:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:23,116 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:03:23,116 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:03:23,119 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:23,124 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:23,125 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:03:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-25 00:03:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:03:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-09-25 00:03:23,166 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2024-09-25 00:03:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:23,167 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-09-25 00:03:23,167 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-09-25 00:03:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:23,170 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:23,170 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:23,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:03:23,171 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:23,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 801118595, now seen corresponding path program 1 times [2024-09-25 00:03:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198458796] [2024-09-25 00:03:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:23,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:03:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:23,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198458796] [2024-09-25 00:03:23,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198458796] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:23,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:23,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 00:03:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854310100] [2024-09-25 00:03:23,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:23,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:23,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:23,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:23,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:23,326 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:23,428 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 00:03:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:03:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 00:03:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:23,429 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:03:23,430 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 00:03:23,430 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-25 00:03:23,432 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:23,433 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 00:03:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 00:03:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:03:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-25 00:03:23,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-09-25 00:03:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:23,449 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-25 00:03:23,449 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-25 00:03:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:23,451 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:23,451 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:23,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:03:23,452 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:23,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 802786891, now seen corresponding path program 1 times [2024-09-25 00:03:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696443584] [2024-09-25 00:03:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:23,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:03:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696443584] [2024-09-25 00:03:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696443584] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:23,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:03:23,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032711106] [2024-09-25 00:03:23,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:23,623 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:03:23,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:03:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:03:23,626 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:23,776 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-25 00:03:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:23,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 00:03:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:23,779 INFO L225 Difference]: With dead ends: 35 [2024-09-25 00:03:23,779 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:03:23,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:03:23,781 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:23,781 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:03:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-25 00:03:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:03:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 00:03:23,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2024-09-25 00:03:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:23,800 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 00:03:23,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:23,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 00:03:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 00:03:23,803 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:23,804 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:23,804 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:03:23,805 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:23,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1280493866, now seen corresponding path program 1 times [2024-09-25 00:03:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904653816] [2024-09-25 00:03:23,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:23,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924533616] [2024-09-25 00:03:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:23,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:23,832 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-25 00:03:23,836 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-25 00:03:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:23,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:23,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:03:23,977 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:23,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904653816] [2024-09-25 00:03:23,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924533616] [2024-09-25 00:03:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924533616] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:23,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067127372] [2024-09-25 00:03:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:23,981 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:23,983 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:03:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:24,045 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-09-25 00:03:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-25 00:03:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:24,047 INFO L225 Difference]: With dead ends: 39 [2024-09-25 00:03:24,047 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:03:24,047 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-25 00:03:24,048 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:24,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:03:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:03:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-25 00:03:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 00:03:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-09-25 00:03:24,076 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2024-09-25 00:03:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:24,077 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-09-25 00:03:24,077 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:03:24,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-09-25 00:03:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:03:24,078 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:24,079 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:24,097 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:03:24,282 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-25 00:03:24,283 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:24,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 925975787, now seen corresponding path program 1 times [2024-09-25 00:03:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367152847] [2024-09-25 00:03:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403385972] [2024-09-25 00:03:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:24,313 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-25 00:03:24,314 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-25 00:03:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:24,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:03:24,422 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:24,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:24,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367152847] [2024-09-25 00:03:24,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403385972] [2024-09-25 00:03:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403385972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255321762] [2024-09-25 00:03:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:24,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:24,427 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:03:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:24,475 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-25 00:03:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-25 00:03:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:24,477 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:03:24,478 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 00:03:24,479 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-25 00:03:24,482 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:24,482 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:03:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 00:03:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 00:03:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:03:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 00:03:24,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-09-25 00:03:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:24,500 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 00:03:24,500 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:03:24,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 00:03:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:24,505 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:24,505 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:24,524 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:03:24,706 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-25 00:03:24,706 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:24,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1435580062, now seen corresponding path program 1 times [2024-09-25 00:03:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:24,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855446381] [2024-09-25 00:03:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855446381] [2024-09-25 00:03:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855446381] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488802183] [2024-09-25 00:03:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:24,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:24,868 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-25 00:03:24,869 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-25 00:03:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:24,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:24,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:24,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:25,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488802183] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:25,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:03:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 00:03:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571654502] [2024-09-25 00:03:25,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:25,084 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 00:03:25,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 00:03:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:03:25,085 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:25,309 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-09-25 00:03:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:03:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 29 [2024-09-25 00:03:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:25,311 INFO L225 Difference]: With dead ends: 79 [2024-09-25 00:03:25,312 INFO L226 Difference]: Without dead ends: 70 [2024-09-25 00:03:25,312 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:03:25,313 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:25,313 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 49 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-25 00:03:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-09-25 00:03:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:03:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-09-25 00:03:25,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2024-09-25 00:03:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:25,331 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-09-25 00:03:25,332 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:25,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-09-25 00:03:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:25,333 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:25,333 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:25,350 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:03:25,533 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-25 00:03:25,534 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:25,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1437248358, now seen corresponding path program 1 times [2024-09-25 00:03:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:25,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181398998] [2024-09-25 00:03:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181398998] [2024-09-25 00:03:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181398998] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126399318] [2024-09-25 00:03:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:25,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:25,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:25,682 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-25 00:03:25,683 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-25 00:03:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:25,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:03:25,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:25,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126399318] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 10 [2024-09-25 00:03:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528885314] [2024-09-25 00:03:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:25,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:03:25,892 INFO L87 Difference]: Start difference. First operand 66 states and 84 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:03:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:25,979 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2024-09-25 00:03:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:25,980 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), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-25 00:03:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:25,981 INFO L225 Difference]: With dead ends: 80 [2024-09-25 00:03:25,981 INFO L226 Difference]: Without dead ends: 78 [2024-09-25 00:03:25,981 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:03:25,982 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:25,982 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-25 00:03:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-25 00:03:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:03:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2024-09-25 00:03:26,012 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 29 [2024-09-25 00:03:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:26,012 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2024-09-25 00:03:26,012 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:03:26,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2024-09-25 00:03:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 00:03:26,014 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:26,014 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:26,033 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:03:26,214 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:26,214 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:26,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 857281179, now seen corresponding path program 2 times [2024-09-25 00:03:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064391584] [2024-09-25 00:03:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:26,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180265899] [2024-09-25 00:03:26,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:03:26,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:26,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:26,229 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-25 00:03:26,236 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-25 00:03:26,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:03:26,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:03:26,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 00:03:26,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:26,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:26,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064391584] [2024-09-25 00:03:26,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:26,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180265899] [2024-09-25 00:03:26,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180265899] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:26,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:26,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 00:03:26,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910213724] [2024-09-25 00:03:26,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:26,529 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:03:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:03:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:03:26,531 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:03:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:26,714 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-09-25 00:03:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2024-09-25 00:03:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:26,715 INFO L225 Difference]: With dead ends: 78 [2024-09-25 00:03:26,716 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:03:26,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:03:26,717 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:26,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:03:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:03:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:03:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:03:26,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-25 00:03:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:26,723 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:03:26,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:03:26,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:03:26,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:03:26,726 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:03:26,744 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-25 00:03:26,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 00:03:26,931 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:26,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:03:27,580 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:03:27,601 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 00:03:27,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:03:27 BoogieIcfgContainer [2024-09-25 00:03:27,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:03:27,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:03:27,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:03:27,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:03:27,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:22" (3/4) ... [2024-09-25 00:03:27,607 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:03:27,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:03:27,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:03:27,663 INFO L158 Benchmark]: Toolchain (without parser) took 5658.83ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 93.9MB in the beginning and 108.2MB in the end (delta: -14.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,663 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:27,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.32ms. Allocated memory is still 159.4MB. Free memory was 93.7MB in the beginning and 82.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.28ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 81.1MB in the end (delta: 976.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,664 INFO L158 Benchmark]: Boogie Preprocessor took 32.12ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:27,664 INFO L158 Benchmark]: RCFGBuilder took 415.00ms. Allocated memory is still 159.4MB. Free memory was 79.4MB in the beginning and 121.4MB in the end (delta: -42.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,664 INFO L158 Benchmark]: TraceAbstraction took 4908.17ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 120.8MB in the beginning and 110.3MB in the end (delta: 10.5MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,665 INFO L158 Benchmark]: Witness Printer took 57.92ms. Allocated memory is still 192.9MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:03:27,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.32ms. Allocated memory is still 159.4MB. Free memory was 93.7MB in the beginning and 82.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.28ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 81.1MB in the end (delta: 976.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.12ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 415.00ms. Allocated memory is still 159.4MB. Free memory was 79.4MB in the beginning and 121.4MB in the end (delta: -42.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4908.17ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 120.8MB in the beginning and 110.3MB in the end (delta: 10.5MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Witness Printer took 57.92ms. Allocated memory is still 192.9MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 157 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 7 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 168/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((__int128) a * 2) + ((__int128) a * a)) + 1) == s) && (\old(counter) == 0)) && (t == (((__int128) a * 2) + 1))) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:03:27,687 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE