./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound20.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_unwindbound20.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 4b6ae28789704f5fd465d11d450ce27cd9b971ac76fe8e36268d0ace5b5b057f --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:42,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:03:42,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:03:42,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:03:42,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:03:42,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:03:42,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:03:42,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:03:42,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:03:42,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:03:42,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:03:42,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:03:42,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:03:42,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:03:42,750 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:03:42,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:03:42,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:03:42,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:03:42,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:03:42,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:03:42,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:03:42,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:03:42,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:03:42,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:03:42,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:03:42,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:03:42,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:03:42,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:03:42,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:03:42,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:03:42,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:03:42,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:03:42,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:42,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:03:42,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:03:42,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:03:42,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:03:42,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:03:42,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:03:42,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:03:42,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:03:42,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:03:42,760 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 -> 4b6ae28789704f5fd465d11d450ce27cd9b971ac76fe8e36268d0ace5b5b057f 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:42,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:03:43,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:03:43,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:03:43,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:03:43,018 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:03:43,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2024-09-25 00:03:44,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:03:45,133 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:03:45,134 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2024-09-25 00:03:45,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7c069eee9/f91e323ad0244c9c8ef655b5c7ac97c2/FLAG7feb507b0 [2024-09-25 00:03:45,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7c069eee9/f91e323ad0244c9c8ef655b5c7ac97c2 [2024-09-25 00:03:45,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:03:45,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:03:45,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:45,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:03:45,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:03:45,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:45" (1/1) ... [2024-09-25 00:03:45,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e3f50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:45, skipping insertion in model container [2024-09-25 00:03:45,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:45" (1/1) ... [2024-09-25 00:03:45,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:03:45,550 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_unwindbound20.c[520,533] [2024-09-25 00:03:45,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:45,624 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:03:45,648 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_unwindbound20.c[520,533] [2024-09-25 00:03:45,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:45,700 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:03:45,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:45 WrapperNode [2024-09-25 00:03:45,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:45,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:45,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:03:45,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:03:45,722 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:45" (1/1) ... [2024-09-25 00:03:45,736 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:45" (1/1) ... [2024-09-25 00:03:45,747 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:03:45,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:45,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:03:45,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:03:45,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:03:45,773 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:45" (1/1) ... [2024-09-25 00:03:45,774 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:45" (1/1) ... [2024-09-25 00:03:45,779 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:45" (1/1) ... [2024-09-25 00:03:45,813 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:45,814 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:45" (1/1) ... [2024-09-25 00:03:45,814 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:45" (1/1) ... [2024-09-25 00:03:45,821 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:45" (1/1) ... [2024-09-25 00:03:45,829 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:45" (1/1) ... [2024-09-25 00:03:45,830 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:45" (1/1) ... [2024-09-25 00:03:45,831 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:45" (1/1) ... [2024-09-25 00:03:45,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:03:45,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:03:45,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:03:45,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:03:45,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:45" (1/1) ... [2024-09-25 00:03:45,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:45,915 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:45,925 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:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:03:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:03:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:03:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:03:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:03:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:03:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:03:46,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:03:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:03:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:03:46,122 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:03:46,124 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:03:46,379 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:03:46,379 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:03:46,423 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:03:46,431 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:03:46,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:46 BoogieIcfgContainer [2024-09-25 00:03:46,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:03:46,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:03:46,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:03:46,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:03:46,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:03:45" (1/3) ... [2024-09-25 00:03:46,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c673fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:46, skipping insertion in model container [2024-09-25 00:03:46,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:45" (2/3) ... [2024-09-25 00:03:46,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c673fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:46, skipping insertion in model container [2024-09-25 00:03:46,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:46" (3/3) ... [2024-09-25 00:03:46,451 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.c [2024-09-25 00:03:46,489 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:03:46,489 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:03:46,595 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:03:46,602 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;@436dea56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:03:46,603 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:03:46,613 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:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 00:03:46,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:46,630 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:46,630 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:46,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash -97680429, now seen corresponding path program 1 times [2024-09-25 00:03:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573444706] [2024-09-25 00:03:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:46,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:47,012 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:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573444706] [2024-09-25 00:03:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573444706] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:03:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945759127] [2024-09-25 00:03:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:47,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:03:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:03:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:47,092 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:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:47,284 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2024-09-25 00:03:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:03:47,287 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:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:47,300 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:03:47,301 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:03:47,313 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:47,323 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:47,324 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:03:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-25 00:03:47,399 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:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-09-25 00:03:47,406 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2024-09-25 00:03:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:47,411 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-09-25 00:03:47,412 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:47,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-09-25 00:03:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:47,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:47,413 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:47,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:03:47,414 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:47,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash 801118595, now seen corresponding path program 1 times [2024-09-25 00:03:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376207599] [2024-09-25 00:03:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:47,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:47,756 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:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376207599] [2024-09-25 00:03:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376207599] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:47,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 00:03:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467204353] [2024-09-25 00:03:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:47,762 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:47,763 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:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:47,865 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 00:03:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:03:47,865 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:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:47,867 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:03:47,867 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 00:03:47,869 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:47,870 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:47,872 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:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 00:03:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 00:03:47,885 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:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-25 00:03:47,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-09-25 00:03:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:47,888 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-25 00:03:47,889 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:47,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-25 00:03:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:47,891 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:47,891 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:47,891 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:03:47,892 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:47,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash 802786891, now seen corresponding path program 1 times [2024-09-25 00:03:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665691693] [2024-09-25 00:03:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:48,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:48,024 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:48,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:48,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665691693] [2024-09-25 00:03:48,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665691693] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:48,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:48,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:03:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754688573] [2024-09-25 00:03:48,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:48,026 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:03:48,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:03:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:03:48,028 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:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:48,136 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-25 00:03:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:48,136 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:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:48,137 INFO L225 Difference]: With dead ends: 35 [2024-09-25 00:03:48,137 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:03:48,138 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:03:48,139 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:48,139 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:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:03:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-25 00:03:48,148 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:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 00:03:48,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2024-09-25 00:03:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:48,150 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 00:03:48,150 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:48,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 00:03:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 00:03:48,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:48,152 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:48,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:03:48,152 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:48,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1280493866, now seen corresponding path program 1 times [2024-09-25 00:03:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875213103] [2024-09-25 00:03:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353287174] [2024-09-25 00:03:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:48,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:48,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:48,168 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:48,170 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:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:48,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:48,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:48,328 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:48,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875213103] [2024-09-25 00:03:48,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:48,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353287174] [2024-09-25 00:03:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353287174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:48,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:48,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183873590] [2024-09-25 00:03:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:48,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:48,332 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:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:48,378 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-09-25 00:03:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:48,379 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:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:48,380 INFO L225 Difference]: With dead ends: 39 [2024-09-25 00:03:48,380 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:03:48,380 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:48,381 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:48,382 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:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:03:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-25 00:03:48,390 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:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-09-25 00:03:48,391 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2024-09-25 00:03:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:48,392 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-09-25 00:03:48,392 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:48,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-09-25 00:03:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:03:48,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:48,393 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:48,413 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:03:48,597 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:48,599 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 925975787, now seen corresponding path program 1 times [2024-09-25 00:03:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893211703] [2024-09-25 00:03:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:48,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156835079] [2024-09-25 00:03:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:48,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:48,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:48,625 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:48,628 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:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:48,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:48,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:48,721 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:48,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:48,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893211703] [2024-09-25 00:03:48,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156835079] [2024-09-25 00:03:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156835079] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:48,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868317422] [2024-09-25 00:03:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:48,723 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:48,724 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:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:48,766 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-25 00:03:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:48,766 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:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:48,768 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:03:48,768 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 00:03:48,768 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:48,769 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:48,770 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:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 00:03:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 00:03:48,777 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:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 00:03:48,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-09-25 00:03:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:48,779 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 00:03:48,779 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:48,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 00:03:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:48,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:48,780 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:48,798 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:03:48,981 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:48,982 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:48,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1435580062, now seen corresponding path program 1 times [2024-09-25 00:03:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951652861] [2024-09-25 00:03:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,104 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:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951652861] [2024-09-25 00:03:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951652861] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726851241] [2024-09-25 00:03:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:49,110 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:49,115 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:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:49,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:49,204 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:49,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:49,269 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:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726851241] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:49,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:03:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 00:03:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703803225] [2024-09-25 00:03:49,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:49,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 00:03:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 00:03:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:03:49,272 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:49,499 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-09-25 00:03:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:03:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 29 [2024-09-25 00:03:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:49,501 INFO L225 Difference]: With dead ends: 79 [2024-09-25 00:03:49,501 INFO L226 Difference]: Without dead ends: 70 [2024-09-25 00:03:49,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:03:49,502 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:49,503 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 49 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:03:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-25 00:03:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-09-25 00:03:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:03:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-09-25 00:03:49,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2024-09-25 00:03:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:49,550 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-09-25 00:03:49,550 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:49,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-09-25 00:03:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:49,552 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:49,552 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:49,569 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:49,755 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:49,756 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:49,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:49,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1437248358, now seen corresponding path program 1 times [2024-09-25 00:03:49,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:49,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694549128] [2024-09-25 00:03:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:49,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694549128] [2024-09-25 00:03:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694549128] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671035220] [2024-09-25 00:03:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:49,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:49,877 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:49,884 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:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:49,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:03:49,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:50,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:50,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671035220] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:50,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:50,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 10 [2024-09-25 00:03:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305472884] [2024-09-25 00:03:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:50,132 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:03:50,133 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:03:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:50,220 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2024-09-25 00:03:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-25 00:03:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:50,226 INFO L225 Difference]: With dead ends: 80 [2024-09-25 00:03:50,226 INFO L226 Difference]: Without dead ends: 78 [2024-09-25 00:03:50,227 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:50,228 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:50,228 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-25 00:03:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-25 00:03:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:03:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2024-09-25 00:03:50,243 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 29 [2024-09-25 00:03:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:50,244 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2024-09-25 00:03:50,244 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:03:50,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2024-09-25 00:03:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 00:03:50,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:50,245 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:50,263 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:50,446 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:50,447 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:50,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash 857281179, now seen corresponding path program 2 times [2024-09-25 00:03:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395878901] [2024-09-25 00:03:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51863295] [2024-09-25 00:03:50,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:03:50,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:50,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:50,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:03:50,469 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:03:50,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:03:50,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:03:50,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 00:03:50,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:50,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:03:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395878901] [2024-09-25 00:03:50,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51863295] [2024-09-25 00:03:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51863295] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:50,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:03:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 00:03:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755826418] [2024-09-25 00:03:50,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:50,776 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:03:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:03:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:03:50,777 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:03:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:50,963 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-09-25 00:03:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:50,964 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:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:50,964 INFO L225 Difference]: With dead ends: 78 [2024-09-25 00:03:50,964 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:03:50,965 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:50,966 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:50,966 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:03:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:03:50,967 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:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:03:50,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-25 00:03:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:50,968 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:03:50,968 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:50,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:03:50,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:03:50,971 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:03:50,993 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:03:51,175 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 00:03:51,179 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:51,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:03:51,787 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:03:51,803 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:51,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:03:51 BoogieIcfgContainer [2024-09-25 00:03:51,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:03:51,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:03:51,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:03:51,806 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:03:51,807 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:46" (3/4) ... [2024-09-25 00:03:51,808 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:03:51,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:03:51,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:03:51,855 INFO L158 Benchmark]: Toolchain (without parser) took 6661.97ms. Allocated memory is still 218.1MB. Free memory was 144.4MB in the beginning and 130.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,856 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:51,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.48ms. Allocated memory is still 218.1MB. Free memory was 143.8MB in the beginning and 132.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.56ms. Allocated memory is still 218.1MB. Free memory was 132.5MB in the beginning and 131.8MB in the end (delta: 638.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:03:51,856 INFO L158 Benchmark]: Boogie Preprocessor took 86.39ms. Allocated memory is still 218.1MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,857 INFO L158 Benchmark]: RCFGBuilder took 592.71ms. Allocated memory is still 218.1MB. Free memory was 129.7MB in the beginning and 116.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,857 INFO L158 Benchmark]: TraceAbstraction took 5371.06ms. Allocated memory is still 218.1MB. Free memory was 116.3MB in the beginning and 133.9MB in the end (delta: -17.5MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,857 INFO L158 Benchmark]: Witness Printer took 49.27ms. Allocated memory is still 218.1MB. Free memory was 133.9MB in the beginning and 130.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 00:03:51,858 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.11ms. Allocated memory is still 134.2MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.48ms. Allocated memory is still 218.1MB. Free memory was 143.8MB in the beginning and 132.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.56ms. Allocated memory is still 218.1MB. Free memory was 132.5MB in the beginning and 131.8MB in the end (delta: 638.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.39ms. Allocated memory is still 218.1MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.71ms. Allocated memory is still 218.1MB. Free memory was 129.7MB in the beginning and 116.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5371.06ms. Allocated memory is still 218.1MB. Free memory was 116.3MB in the beginning and 133.9MB in the end (delta: -17.5MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 49.27ms. Allocated memory is still 218.1MB. Free memory was 133.9MB in the beginning and 130.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 157 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 7 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 168/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((__int128) a * 2) + ((__int128) a * a)) + 1) == s) && (\old(counter) == 0)) && (t == (((__int128) a * 2) + 1))) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:03:51,874 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