./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.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 f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.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 5bba06987e8c2f8236800dde4bec4c9d50f427f841de99efa853660259681b37 --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-f1d7dc9-m [2024-09-20 12:23:39,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:23:39,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:23:39,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:23:39,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:23:39,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:23:39,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:23:39,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:23:39,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:23:39,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:23:39,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:23:39,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:23:39,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:23:39,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:23:39,353 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:23:39,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:23:39,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:23:39,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:23:39,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:23:39,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:23:39,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:23:39,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:23:39,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:23:39,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:23:39,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:23:39,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:23:39,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:23:39,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:23:39,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:23:39,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:23:39,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:23:39,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:23:39,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:23:39,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:23:39,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:23:39,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:23:39,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:23:39,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:23:39,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:23:39,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:23:39,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:23:39,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:23:39,363 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 -> 5bba06987e8c2f8236800dde4bec4c9d50f427f841de99efa853660259681b37 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-20 12:23:39,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:23:39,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:23:39,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:23:39,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:23:39,674 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:23:39,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c [2024-09-20 12:23:41,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:23:41,360 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:23:41,361 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c [2024-09-20 12:23:41,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ee1646bdc/e4b10976152e43fa982fa9bd1a9ca768/FLAG63044bf7d [2024-09-20 12:23:41,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ee1646bdc/e4b10976152e43fa982fa9bd1a9ca768 [2024-09-20 12:23:41,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:23:41,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:23:41,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:23:41,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:23:41,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:23:41,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:23:41" (1/1) ... [2024-09-20 12:23:41,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7304e94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:41, skipping insertion in model container [2024-09-20 12:23:41,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:23:41" (1/1) ... [2024-09-20 12:23:41,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:23:41,960 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/dijkstra-u_valuebound100.c[525,538] [2024-09-20 12:23:41,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:23:42,006 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:23:42,017 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/dijkstra-u_valuebound100.c[525,538] [2024-09-20 12:23:42,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:23:42,044 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:23:42,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42 WrapperNode [2024-09-20 12:23:42,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:23:42,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:23:42,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:23:42,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:23:42,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,066 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:23:42,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:23:42,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:23:42,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:23:42,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:23:42,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,097 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-20 12:23:42,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:23:42,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:23:42,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:23:42,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:23:42,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (1/1) ... [2024-09-20 12:23:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:23:42,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:42,153 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-20 12:23:42,156 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-20 12:23:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:23:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 12:23:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 12:23:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:23:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:23:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:23:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:23:42,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:23:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:23:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:23:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:23:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:23:42,278 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:23:42,280 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:23:42,531 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 12:23:42,531 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:23:42,561 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:23:42,562 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:23:42,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:23:42 BoogieIcfgContainer [2024-09-20 12:23:42,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:23:42,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:23:42,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:23:42,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:23:42,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:23:41" (1/3) ... [2024-09-20 12:23:42,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5232618e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:23:42, skipping insertion in model container [2024-09-20 12:23:42,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:42" (2/3) ... [2024-09-20 12:23:42,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5232618e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:23:42, skipping insertion in model container [2024-09-20 12:23:42,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:23:42" (3/3) ... [2024-09-20 12:23:42,573 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound100.c [2024-09-20 12:23:42,591 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:23:42,592 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:23:42,670 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:23:42,680 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;@532e3775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:23:42,681 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:23:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 12:23:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-20 12:23:42,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:42,695 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-20 12:23:42,696 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:42,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-20 12:23:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811902235] [2024-09-20 12:23:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:42,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:42,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:42,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:42,932 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-20 12:23:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811902235] [2024-09-20 12:23:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811902235] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:23:42,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:23:42,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:23:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727180489] [2024-09-20 12:23:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:23:42,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:23:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:23:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:23:42,976 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-20 12:23:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:43,025 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-20 12:23:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:23:43,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-20 12:23:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:43,038 INFO L225 Difference]: With dead ends: 66 [2024-09-20 12:23:43,039 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 12:23:43,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:23:43,049 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:43,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:23:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 12:23:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 12:23:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 12:23:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-20 12:23:43,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-20 12:23:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:43,113 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-20 12:23:43,113 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-20 12:23:43,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-20 12:23:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 12:23:43,132 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:43,132 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-20 12:23:43,132 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:23:43,133 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:43,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-20 12:23:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:43,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667390823] [2024-09-20 12:23:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:43,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:43,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:43,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:43,724 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-20 12:23:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667390823] [2024-09-20 12:23:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667390823] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:23:43,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:23:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:23:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365452732] [2024-09-20 12:23:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:23:43,729 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:23:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:23:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:23:43,732 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:23:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:44,100 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-20 12:23:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:23:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23 [2024-09-20 12:23:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:44,103 INFO L225 Difference]: With dead ends: 64 [2024-09-20 12:23:44,103 INFO L226 Difference]: Without dead ends: 46 [2024-09-20 12:23:44,104 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:23:44,105 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:44,106 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-20 12:23:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-20 12:23:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-20 12:23:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-20 12:23:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-20 12:23:44,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-20 12:23:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:44,133 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-20 12:23:44,134 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:23:44,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-20 12:23:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 12:23:44,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:44,137 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] [2024-09-20 12:23:44,138 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:23:44,138 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:44,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-20 12:23:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147649486] [2024-09-20 12:23:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:44,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:44,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:44,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147649486] [2024-09-20 12:23:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147649486] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:23:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454392491] [2024-09-20 12:23:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:44,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:23:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:44,560 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-20 12:23:44,565 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-20 12:23:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:44,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-20 12:23:44,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:23:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:44,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:23:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454392491] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:23:45,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:23:45,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-20 12:23:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745163842] [2024-09-20 12:23:45,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:23:45,003 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 12:23:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 12:23:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-20 12:23:45,005 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:23:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:47,223 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-20 12:23:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:23:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-20 12:23:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:47,228 INFO L225 Difference]: With dead ends: 115 [2024-09-20 12:23:47,228 INFO L226 Difference]: Without dead ends: 97 [2024-09-20 12:23:47,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-20 12:23:47,230 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:47,233 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-09-20 12:23:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-20 12:23:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-20 12:23:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-20 12:23:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-20 12:23:47,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-20 12:23:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:47,267 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-20 12:23:47,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:23:47,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-20 12:23:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-20 12:23:47,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:47,271 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:23:47,291 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:23:47,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:23:47,472 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:47,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-20 12:23:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48146581] [2024-09-20 12:23:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:23:47,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478188441] [2024-09-20 12:23:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:23:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:47,520 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-20 12:23:47,523 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-20 12:23:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:47,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 12:23:47,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:23:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-20 12:23:47,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:23:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48146581] [2024-09-20 12:23:47,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:23:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478188441] [2024-09-20 12:23:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478188441] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:23:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:23:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:23:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927657215] [2024-09-20 12:23:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:23:47,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:23:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:23:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:23:47,636 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 12:23:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:47,817 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-20 12:23:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:23:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-20 12:23:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:47,819 INFO L225 Difference]: With dead ends: 90 [2024-09-20 12:23:47,819 INFO L226 Difference]: Without dead ends: 87 [2024-09-20 12:23:47,820 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-20 12:23:47,821 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:47,821 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:23:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-20 12:23:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-20 12:23:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-20 12:23:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-20 12:23:47,839 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-20 12:23:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:47,839 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-20 12:23:47,840 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 12:23:47,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-20 12:23:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 12:23:47,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:47,841 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:23:47,859 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-20 12:23:48,045 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-20 12:23:48,046 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:48,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-20 12:23:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856469415] [2024-09-20 12:23:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:23:48,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810371622] [2024-09-20 12:23:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:23:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:48,064 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-20 12:23:48,068 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-20 12:23:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:48,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-20 12:23:48,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:23:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:48,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:23:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856469415] [2024-09-20 12:23:51,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:23:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810371622] [2024-09-20 12:23:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810371622] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:23:51,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:23:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-20 12:23:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323610518] [2024-09-20 12:23:51,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:23:51,938 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:23:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:23:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:23:51,939 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-20 12:24:05,468 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-20 12:24:07,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:11,031 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-20 12:24:17,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:24:22,560 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-20 12:24:26,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:24:30,259 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-20 12:24:34,265 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-20 12:24:38,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:24:40,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:24:44,771 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-20 12:24:48,895 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-20 12:24:53,105 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-20 12:24:57,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:25:01,132 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-20 12:25:02,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:25:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:25:02,726 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-20 12:25:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:25:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-20 12:25:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:25:02,729 INFO L225 Difference]: With dead ends: 156 [2024-09-20 12:25:02,729 INFO L226 Difference]: Without dead ends: 132 [2024-09-20 12:25:02,730 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:25:02,730 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 54 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:25:02,731 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 61.3s Time] [2024-09-20 12:25:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-20 12:25:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-20 12:25:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-20 12:25:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-20 12:25:02,771 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-20 12:25:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:25:02,771 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-20 12:25:02,772 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-20 12:25:02,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-20 12:25:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-20 12:25:02,774 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:25:02,774 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:25:02,787 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-20 12:25:02,981 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-20 12:25:02,982 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:25:02,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-20 12:25:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:25:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539754365] [2024-09-20 12:25:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:25:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:25:03,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858569232] [2024-09-20 12:25:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:25:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:25:03,044 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-20 12:25:03,045 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-20 12:25:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:03,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 12:25:03,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:25:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-20 12:25:03,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:25:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:25:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539754365] [2024-09-20 12:25:03,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:25:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858569232] [2024-09-20 12:25:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858569232] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:25:03,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:25:03,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 12:25:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931987893] [2024-09-20 12:25:03,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:25:03,279 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:25:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:25:03,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:25:03,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:25:03,280 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 12:25:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:25:03,773 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-09-20 12:25:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:25:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-20 12:25:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:25:03,777 INFO L225 Difference]: With dead ends: 140 [2024-09-20 12:25:03,777 INFO L226 Difference]: Without dead ends: 138 [2024-09-20 12:25:03,780 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:25:03,781 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-20 12:25:03,781 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-20 12:25:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-20 12:25:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-20 12:25:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 57 states have call successors, (57), 14 states have call predecessors, (57), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-20 12:25:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-09-20 12:25:03,829 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-09-20 12:25:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:25:03,830 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-09-20 12:25:03,830 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 12:25:03,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-09-20 12:25:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 12:25:03,833 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:25:03,833 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:25:03,850 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:25:04,033 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-20 12:25:04,034 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:25:04,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-20 12:25:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:25:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479253442] [2024-09-20 12:25:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:25:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:25:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160587456] [2024-09-20 12:25:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:04,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:25:04,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:25:04,074 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-20 12:25:04,075 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-20 12:25:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:04,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-20 12:25:04,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:25:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-20 12:25:04,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:25:09,093 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-20 12:25:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:25:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479253442] [2024-09-20 12:25:09,103 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:25:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160587456] [2024-09-20 12:25:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160587456] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:25:09,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:25:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-20 12:25:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747868248] [2024-09-20 12:25:09,103 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 12:25:09,103 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:25:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:25:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:25:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-20 12:25:09,106 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:25:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:25:10,782 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-09-20 12:25:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:25:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-20 12:25:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:25:10,784 INFO L225 Difference]: With dead ends: 156 [2024-09-20 12:25:10,784 INFO L226 Difference]: Without dead ends: 138 [2024-09-20 12:25:10,785 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-20 12:25:10,786 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-20 12:25:10,786 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-20 12:25:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-20 12:25:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-20 12:25:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-20 12:25:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-09-20 12:25:10,821 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-09-20 12:25:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:25:10,821 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-09-20 12:25:10,822 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:25:10,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-09-20 12:25:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-20 12:25:10,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:25:10,830 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:25:10,849 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-20 12:25:11,031 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 12:25:11,031 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:25:11,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:25:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-20 12:25:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:25:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760689736] [2024-09-20 12:25:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:25:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:25:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:25:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:25:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 12:25:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 12:25:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 12:25:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 12:25:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 12:25:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:11,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-20 12:25:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-20 12:25:12,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:25:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760689736] [2024-09-20 12:25:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760689736] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:25:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241081642] [2024-09-20 12:25:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:25:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:25:12,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:25:12,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:25:12,059 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-20 12:25:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:25:12,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-20 12:25:12,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:25:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-20 12:25:12,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:25:58,423 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:26:07,361 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:26:23,839 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:27:22,526 WARN L293 SmtUtils]: Spent 45.93s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-20 12:27:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241081642] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:27:22,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:27:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-20 12:27:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936533363] [2024-09-20 12:27:22,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:27:22,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 12:27:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:27:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 12:27:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=497, Unknown=4, NotChecked=0, Total=600 [2024-09-20 12:27:22,532 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-20 12:27:27,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:31,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:35,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:37,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:41,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:45,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 12:27:50,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:54,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:27:58,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:28:02,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:28:06,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:28:10,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:28:14,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []