./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.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_unwindbound1.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 1870b8451d4735c7264ac4337bbb2c1eeecb277125949d2d6e57edbf68a24fac --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:09,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:03:09,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:03:09,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:03:09,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:03:09,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:03:09,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:03:09,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:03:09,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:03:09,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:03:09,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:03:09,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:03:09,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:03:09,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:03:09,447 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:03:09,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:03:09,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:03:09,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:03:09,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:03:09,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:03:09,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:03:09,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:03:09,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:03:09,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:03:09,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:03:09,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:03:09,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:03:09,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:03:09,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:03:09,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:03:09,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:03:09,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:03:09,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:09,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:03:09,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:03:09,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:03:09,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:03:09,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:03:09,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:03:09,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:03:09,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:03:09,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:03:09,457 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 -> 1870b8451d4735c7264ac4337bbb2c1eeecb277125949d2d6e57edbf68a24fac 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:09,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:03:09,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:03:09,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:03:09,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:03:09,725 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:03:09,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2024-09-25 00:03:11,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:03:11,339 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:03:11,339 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2024-09-25 00:03:11,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/37e300a46/1ab555d9b48d4076bec0e20d41af52dd/FLAGc5d32fe99 [2024-09-25 00:03:11,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/37e300a46/1ab555d9b48d4076bec0e20d41af52dd [2024-09-25 00:03:11,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:03:11,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:03:11,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:11,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:03:11,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:03:11,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:11" (1/1) ... [2024-09-25 00:03:11,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a374f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:11, skipping insertion in model container [2024-09-25 00:03:11,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:11" (1/1) ... [2024-09-25 00:03:11,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:03:11,557 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_unwindbound1.c[520,533] [2024-09-25 00:03:11,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:11,580 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:03:11,591 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_unwindbound1.c[520,533] [2024-09-25 00:03:11,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:11,613 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:03:11,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:11 WrapperNode [2024-09-25 00:03:11,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:11,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:11,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:03:11,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:03:11,625 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:11" (1/1) ... [2024-09-25 00:03:11,631 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:11" (1/1) ... [2024-09-25 00:03:11,637 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:03:11,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:11,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:03:11,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:03:11,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:03:11,647 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:11" (1/1) ... [2024-09-25 00:03:11,647 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:11" (1/1) ... [2024-09-25 00:03:11,650 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:11" (1/1) ... [2024-09-25 00:03:11,662 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:11,662 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:11" (1/1) ... [2024-09-25 00:03:11,663 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:11" (1/1) ... [2024-09-25 00:03:11,667 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:11" (1/1) ... [2024-09-25 00:03:11,671 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:11" (1/1) ... [2024-09-25 00:03:11,674 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:11" (1/1) ... [2024-09-25 00:03:11,675 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:11" (1/1) ... [2024-09-25 00:03:11,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:03:11,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:03:11,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:03:11,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:03:11,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:11" (1/1) ... [2024-09-25 00:03:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:11,709 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:11,712 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:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:03:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:03:11,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:03:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:03:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:03:11,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:03:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:03:11,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:03:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:03:11,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:03:11,821 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:03:11,823 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:03:11,977 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:03:11,978 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:03:12,000 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:03:12,000 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:03:12,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:12 BoogieIcfgContainer [2024-09-25 00:03:12,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:03:12,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:03:12,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:03:12,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:03:12,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:03:11" (1/3) ... [2024-09-25 00:03:12,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f546d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:12, skipping insertion in model container [2024-09-25 00:03:12,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:11" (2/3) ... [2024-09-25 00:03:12,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f546d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:12, skipping insertion in model container [2024-09-25 00:03:12,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:12" (3/3) ... [2024-09-25 00:03:12,012 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2024-09-25 00:03:12,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:03:12,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:03:12,077 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:03:12,083 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;@79695e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:03:12,083 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:03:12,087 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:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 00:03:12,092 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:12,092 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:12,092 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:12,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -97680429, now seen corresponding path program 1 times [2024-09-25 00:03:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685652310] [2024-09-25 00:03:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,279 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:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685652310] [2024-09-25 00:03:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685652310] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:03:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731148254] [2024-09-25 00:03:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:12,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:03:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:03:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:12,302 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:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:12,372 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2024-09-25 00:03:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:03:12,374 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:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:12,380 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:03:12,381 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:03:12,383 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:12,386 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.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:12,388 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.0s Time] [2024-09-25 00:03:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:03:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-25 00:03:12,417 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:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-09-25 00:03:12,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2024-09-25 00:03:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:12,420 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-09-25 00:03:12,420 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:12,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-09-25 00:03:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:12,422 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:12,422 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:12,422 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:03:12,423 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:12,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 801118595, now seen corresponding path program 1 times [2024-09-25 00:03:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960855843] [2024-09-25 00:03:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,607 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:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960855843] [2024-09-25 00:03:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960855843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 00:03:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633577883] [2024-09-25 00:03:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:12,610 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:12,611 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:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:12,695 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 00:03:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:03:12,695 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:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:12,697 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:03:12,697 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 00:03:12,698 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:12,699 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:12,699 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:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 00:03:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 00:03:12,712 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:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-25 00:03:12,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-09-25 00:03:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:12,714 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-25 00:03:12,715 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:12,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-25 00:03:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:12,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:12,717 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:12,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:03:12,718 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:12,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 802786891, now seen corresponding path program 1 times [2024-09-25 00:03:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314038700] [2024-09-25 00:03:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:12,907 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:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314038700] [2024-09-25 00:03:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314038700] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:12,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:03:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276770803] [2024-09-25 00:03:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:12,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:03:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:03:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:03:12,910 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:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:13,050 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-25 00:03:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:13,051 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:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:13,052 INFO L225 Difference]: With dead ends: 35 [2024-09-25 00:03:13,053 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:03:13,054 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:13,055 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:13,057 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:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:03:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-25 00:03:13,069 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:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 00:03:13,071 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2024-09-25 00:03:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:13,071 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 00:03:13,071 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:13,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 00:03:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 00:03:13,072 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:13,072 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:13,072 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:03:13,073 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:13,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1280493866, now seen corresponding path program 1 times [2024-09-25 00:03:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:13,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016593992] [2024-09-25 00:03:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:13,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564443926] [2024-09-25 00:03:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:13,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:13,104 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:13,105 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:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:13,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:13,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:13,249 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:13,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016593992] [2024-09-25 00:03:13,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564443926] [2024-09-25 00:03:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564443926] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855970654] [2024-09-25 00:03:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:13,254 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:13,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:13,257 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:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:13,314 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-09-25 00:03:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:13,315 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:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:13,317 INFO L225 Difference]: With dead ends: 39 [2024-09-25 00:03:13,318 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:03:13,319 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:13,320 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:13,320 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:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:03:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-25 00:03:13,335 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:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-09-25 00:03:13,336 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2024-09-25 00:03:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:13,336 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-09-25 00:03:13,336 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:13,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-09-25 00:03:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:03:13,337 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:13,337 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:13,355 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:13,538 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:13,538 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:13,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 925975787, now seen corresponding path program 1 times [2024-09-25 00:03:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346166022] [2024-09-25 00:03:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303003574] [2024-09-25 00:03:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:13,563 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:13,567 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:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:13,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:13,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:13,670 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:13,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346166022] [2024-09-25 00:03:13,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303003574] [2024-09-25 00:03:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303003574] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:13,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:13,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689618987] [2024-09-25 00:03:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:13,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:13,675 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:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:13,723 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-25 00:03:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:13,724 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:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:13,725 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:03:13,725 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 00:03:13,725 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:13,726 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:13,727 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:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 00:03:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 00:03:13,734 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:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 00:03:13,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-09-25 00:03:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:13,736 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 00:03:13,736 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:13,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 00:03:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:13,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:13,737 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:13,754 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 00:03:13,941 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:13,942 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:13,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1435580062, now seen corresponding path program 1 times [2024-09-25 00:03:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625053800] [2024-09-25 00:03:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,225 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:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625053800] [2024-09-25 00:03:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625053800] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938982135] [2024-09-25 00:03:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:14,234 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:14,235 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:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:03:14,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:14,382 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:14,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 00:03:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938982135] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 10 [2024-09-25 00:03:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909969670] [2024-09-25 00:03:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:14,463 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:03:14,464 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:14,541 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-25 00:03:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:14,544 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:03:14,545 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 00:03:14,545 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:14,547 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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:14,548 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 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:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 00:03:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-25 00:03:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:03:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-09-25 00:03:14,569 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2024-09-25 00:03:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:14,570 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-09-25 00:03:14,570 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:14,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-09-25 00:03:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 00:03:14,571 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:14,571 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:14,587 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:03:14,772 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:14,772 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:14,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -998764125, now seen corresponding path program 1 times [2024-09-25 00:03:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222045142] [2024-09-25 00:03:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068488284] [2024-09-25 00:03:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:14,796 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:14,798 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:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:14,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 00:03:14,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:14,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222045142] [2024-09-25 00:03:15,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068488284] [2024-09-25 00:03:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068488284] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:15,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 00:03:15,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955182419] [2024-09-25 00:03:15,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:15,123 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:03:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:15,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:03:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:03:15,124 INFO L87 Difference]: Start difference. First operand 42 states and 47 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:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:15,291 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-09-25 00:03:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:15,292 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:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:15,292 INFO L225 Difference]: With dead ends: 51 [2024-09-25 00:03:15,293 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:03:15,293 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:15,294 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:15,294 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:03:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:03:15,295 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:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:03:15,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-25 00:03:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:15,296 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:03:15,296 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:15,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:03:15,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:03:15,299 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:03:15,315 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:15,503 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:15,506 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:15,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:03:15,904 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:03:15,924 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:15,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:03:15 BoogieIcfgContainer [2024-09-25 00:03:15,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:03:15,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:03:15,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:03:15,927 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:03:15,927 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:12" (3/4) ... [2024-09-25 00:03:15,929 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:03:15,988 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:03:15,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:03:15,989 INFO L158 Benchmark]: Toolchain (without parser) took 4612.39ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 87.8MB in the beginning and 138.0MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:15,990 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:15,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 75.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:03:15,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.39ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 75.0MB in the end (delta: 908.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:15,990 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 159.4MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:03:15,991 INFO L158 Benchmark]: RCFGBuilder took 324.11ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 60.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:03:15,991 INFO L158 Benchmark]: TraceAbstraction took 3922.91ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 59.8MB in the beginning and 140.1MB in the end (delta: -80.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-09-25 00:03:15,991 INFO L158 Benchmark]: Witness Printer took 62.30ms. Allocated memory is still 199.2MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:03:15,994 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.17ms. Allocated memory is still 117.4MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 75.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.39ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 75.0MB in the end (delta: 908.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 159.4MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.11ms. Allocated memory is still 159.4MB. Free memory was 73.4MB in the beginning and 60.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3922.91ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 59.8MB in the beginning and 140.1MB in the end (delta: -80.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 62.30ms. Allocated memory is still 199.2MB. Free memory was 140.1MB in the beginning and 138.0MB 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: 3.4s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 144 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 5 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 112/138 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:16,011 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE