./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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/geo1-ll_unwindbound5.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 9d96fce9cba7910d867f13bc16c5bd69d4168f707f39f60b6964bcaea0f2a9ec --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:58:55,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:58:55,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:58:55,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:58:55,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:58:55,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:58:55,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:58:55,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:58:55,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:58:55,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:58:55,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:58:55,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:58:55,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:58:55,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:58:55,951 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:58:55,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:58:55,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:58:55,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:58:55,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:58:55,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:58:55,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:58:55,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:58:55,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:58:55,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:58:55,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:58:55,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:58:55,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:58:55,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:58:55,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:58:55,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:58:55,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:58:55,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:58:55,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:55,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:58:55,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:58:55,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:58:55,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:58:55,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:58:55,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:58:55,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:58:55,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:58:55,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:58:55,963 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 -> 9d96fce9cba7910d867f13bc16c5bd69d4168f707f39f60b6964bcaea0f2a9ec 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 10:58:56,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:58:56,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:58:56,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:58:56,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:58:56,351 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:58:56,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-25 10:58:57,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:58:58,027 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:58:58,028 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-25 10:58:58,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/929d65ed9/02658adb66ce48eb81d04a0586fcd2e6/FLAGa00f66817 [2024-09-25 10:58:58,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/929d65ed9/02658adb66ce48eb81d04a0586fcd2e6 [2024-09-25 10:58:58,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:58:58,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:58:58,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:58,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:58:58,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:58:58,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bf83aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58, skipping insertion in model container [2024-09-25 10:58:58,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:58:58,261 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/geo1-ll_unwindbound5.c[546,559] [2024-09-25 10:58:58,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:58,311 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:58:58,330 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/geo1-ll_unwindbound5.c[546,559] [2024-09-25 10:58:58,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:58,358 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:58:58,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58 WrapperNode [2024-09-25 10:58:58,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:58,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:58,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:58:58,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:58:58,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,380 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:58:58,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:58,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:58:58,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:58:58,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:58:58,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,408 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 10:58:58,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:58:58,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:58:58,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:58:58,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:58:58,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (1/1) ... [2024-09-25 10:58:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:58:58,459 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 10:58:58,462 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 10:58:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:58:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:58:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:58:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:58:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:58:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:58:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:58:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:58:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:58:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:58:58,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:58:58,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:58:58,576 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:58:58,578 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:58:58,763 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 10:58:58,764 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:58:58,788 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:58:58,789 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:58:58,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:58 BoogieIcfgContainer [2024-09-25 10:58:58,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:58:58,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:58:58,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:58:58,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:58:58,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:58:58" (1/3) ... [2024-09-25 10:58:58,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8981b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:58, skipping insertion in model container [2024-09-25 10:58:58,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:58" (2/3) ... [2024-09-25 10:58:58,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8981b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:58, skipping insertion in model container [2024-09-25 10:58:58,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:58" (3/3) ... [2024-09-25 10:58:58,799 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound5.c [2024-09-25 10:58:58,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:58:58,814 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:58:58,872 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:58:58,879 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;@4a129956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:58:58,880 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:58:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:58:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:58:58,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:58,893 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:58,893 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:58,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1666515900, now seen corresponding path program 1 times [2024-09-25 10:58:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:58:58,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476616578] [2024-09-25 10:58:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:58:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:58:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:58:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:58:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:58:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:58:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476616578] [2024-09-25 10:58:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476616578] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:58:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:58:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:58:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543974189] [2024-09-25 10:58:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:58:59,084 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:58:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:58:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:58:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:58:59,108 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:58:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:58:59,200 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-25 10:58:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:58:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:58:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:58:59,211 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:58:59,212 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 10:58:59,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 10:58:59,220 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:58:59,221 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:58:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 10:58:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-25 10:58:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:58:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-25 10:58:59,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2024-09-25 10:58:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:58:59,263 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-25 10:58:59,263 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:58:59,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-25 10:58:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:58:59,268 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:59,268 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:59,268 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:58:59,269 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:59,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash -387848543, now seen corresponding path program 1 times [2024-09-25 10:58:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:58:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875612599] [2024-09-25 10:58:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:58:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:58:59,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581802931] [2024-09-25 10:58:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:59,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:58:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:58:59,319 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 10:58:59,321 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 10:58:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:58:59,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:58:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:58:59,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:58:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:58:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875612599] [2024-09-25 10:58:59,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:58:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581802931] [2024-09-25 10:58:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581802931] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:58:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:58:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:58:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966788684] [2024-09-25 10:58:59,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:58:59,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:58:59,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:58:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:58:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:58:59,489 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:58:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:58:59,541 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-25 10:58:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:58:59,542 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-25 10:58:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:58:59,543 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:58:59,543 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:58:59,544 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 10:58:59,545 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:58:59,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:58:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:58:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-25 10:58:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:58:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-25 10:58:59,557 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2024-09-25 10:58:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:58:59,559 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-25 10:58:59,559 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:58:59,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-25 10:58:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:58:59,560 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:59,560 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:59,583 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:58:59,764 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:58:59,765 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:59,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 783720481, now seen corresponding path program 1 times [2024-09-25 10:58:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:58:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287353092] [2024-09-25 10:58:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:58:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:58:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:58:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:59,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:58:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:59:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:59:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287353092] [2024-09-25 10:59:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287353092] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:59:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:59:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:59:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172353809] [2024-09-25 10:59:00,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:59:00,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:59:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:59:00,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:59:00,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:59:00,009 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:59:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:59:00,089 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-25 10:59:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:59:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-25 10:59:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:59:00,093 INFO L225 Difference]: With dead ends: 39 [2024-09-25 10:59:00,093 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:59:00,094 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:59:00,096 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:59:00,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:59:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:59:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:59:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:59:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-25 10:59:00,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2024-09-25 10:59:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:59:00,110 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-25 10:59:00,111 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:59:00,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:59:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-25 10:59:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:59:00,112 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:59:00,112 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:59:00,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:59:00,113 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:59:00,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:59:00,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1293449266, now seen corresponding path program 1 times [2024-09-25 10:59:00,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:59:00,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145330054] [2024-09-25 10:59:00,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:59:00,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:59:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:59:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:59:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:59:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:59:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:59:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:59:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145330054] [2024-09-25 10:59:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145330054] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:59:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801749521] [2024-09-25 10:59:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:59:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:59:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:59:00,511 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 10:59:00,512 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 10:59:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:00,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 10:59:00,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:59:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:59:00,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:59:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:59:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801749521] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:59:00,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:59:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-09-25 10:59:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839475469] [2024-09-25 10:59:00,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:59:00,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:59:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:59:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:59:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:59:00,936 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:59:05,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:59:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:59:05,250 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-25 10:59:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:59:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2024-09-25 10:59:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:59:05,252 INFO L225 Difference]: With dead ends: 45 [2024-09-25 10:59:05,252 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 10:59:05,253 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:59:05,255 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:59:05,256 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-09-25 10:59:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 10:59:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-25 10:59:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:59:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-25 10:59:05,269 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-25 10:59:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:59:05,270 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-25 10:59:05,270 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:59:05,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:59:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-25 10:59:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 10:59:05,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:59:05,272 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:59:05,290 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:59:05,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:59:05,473 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:59:05,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:59:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1959775791, now seen corresponding path program 1 times [2024-09-25 10:59:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:59:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138891055] [2024-09-25 10:59:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:59:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:59:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:59:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305206931] [2024-09-25 10:59:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:59:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:59:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:59:05,526 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 10:59:05,528 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 10:59:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:59:05,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 10:59:05,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:59:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:59:05,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:59:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 10 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:59:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:59:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138891055] [2024-09-25 10:59:18,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:59:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305206931] [2024-09-25 10:59:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305206931] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:59:18,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:59:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-09-25 10:59:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204310628] [2024-09-25 10:59:18,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:59:18,730 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:59:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:59:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:59:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=166, Unknown=3, NotChecked=0, Total=210 [2024-09-25 10:59:18,733 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 10:59:29,316 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:59:33,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:59:49,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:59:53,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:59:57,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:01,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:05,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:09,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:29,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:33,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:37,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:41,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:45,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:49,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:53,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:00:57,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:01:01,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:01:05,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:01:09,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:01:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:01:09,958 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-09-25 11:01:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:01:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2024-09-25 11:01:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:01:09,960 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:01:09,960 INFO L226 Difference]: Without dead ends: 64 [2024-09-25 11:01:09,960 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=74, Invalid=259, Unknown=9, NotChecked=0, Total=342 [2024-09-25 11:01:09,961 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.7s IncrementalHoareTripleChecker+Time [2024-09-25 11:01:09,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 214 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 72.7s Time] [2024-09-25 11:01:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-25 11:01:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-09-25 11:01:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:01:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-25 11:01:09,999 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 38 [2024-09-25 11:01:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:01:09,999 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-25 11:01:09,999 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 11:01:10,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-25 11:01:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 11:01:10,001 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:01:10,001 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:01:10,020 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:01:10,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:01:10,202 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:01:10,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash -701383951, now seen corresponding path program 1 times [2024-09-25 11:01:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:01:10,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624603006] [2024-09-25 11:01:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:01:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:01:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:01:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:01:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:01:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 11:01:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 11:01:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 11:01:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:01:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624603006] [2024-09-25 11:01:10,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624603006] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:01:10,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375022638] [2024-09-25 11:01:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:01:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:01:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:01:10,362 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 11:01:10,365 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 11:01:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:10,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 11:01:10,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:01:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:01:10,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:01:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 11:01:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375022638] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:01:10,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:01:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-09-25 11:01:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331461833] [2024-09-25 11:01:10,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:01:10,561 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:01:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:01:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:01:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:01:10,562 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-25 11:01:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:01:10,743 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-09-25 11:01:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:01:10,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 39 [2024-09-25 11:01:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:01:10,746 INFO L225 Difference]: With dead ends: 75 [2024-09-25 11:01:10,746 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 11:01:10,747 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:01:10,747 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:01:10,747 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 47 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:01:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 11:01:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-25 11:01:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.065217391304348) internal successors, (49), 48 states have internal predecessors, (49), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:01:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-09-25 11:01:10,774 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 39 [2024-09-25 11:01:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:01:10,774 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-09-25 11:01:10,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-25 11:01:10,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-09-25 11:01:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 11:01:10,776 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:01:10,777 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:01:10,793 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 11:01:10,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:01:10,981 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:01:10,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1794971433, now seen corresponding path program 2 times [2024-09-25 11:01:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:01:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488270784] [2024-09-25 11:01:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:01:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:01:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:01:11,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996089385] [2024-09-25 11:01:11,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:01:11,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:01:11,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:01:11,059 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 11:01:11,060 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 11:01:11,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:01:11,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:01:11,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-25 11:01:11,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:01:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-25 11:01:11,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:01:47,753 WARN L876 $PredicateComparison]: unable to prove that (= (mod (+ (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0) is different from true [2024-09-25 11:02:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 0 refuted. 32 times theorem prover too weak. 44 trivial. 18 not checked. [2024-09-25 11:02:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:02:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488270784] [2024-09-25 11:02:17,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:02:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996089385] [2024-09-25 11:02:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996089385] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:02:17,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:02:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2024-09-25 11:02:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800992555] [2024-09-25 11:02:17,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:02:17,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 11:02:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:02:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 11:02:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=293, Unknown=15, NotChecked=36, Total=420 [2024-09-25 11:02:17,854 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 14 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-25 11:02:21,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:02:26,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:02:49,605 WARN L293 SmtUtils]: Spent 21.69s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 11:03:18,293 WARN L293 SmtUtils]: Spent 19.91s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 11:03:22,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []