./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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_valuebound2.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 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 23:34:54,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 23:34:54,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 23:34:54,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 23:34:54,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 23:34:55,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 23:34:55,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 23:34:55,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 23:34:55,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 23:34:55,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 23:34:55,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 23:34:55,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 23:34:55,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 23:34:55,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 23:34:55,011 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 23:34:55,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 23:34:55,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 23:34:55,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 23:34:55,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 23:34:55,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 23:34:55,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 23:34:55,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 23:34:55,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 23:34:55,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 23:34:55,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 23:34:55,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 23:34:55,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 23:34:55,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 23:34:55,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 23:34:55,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 23:34:55,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 23:34:55,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 23:34:55,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:34:55,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 23:34:55,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 23:34:55,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 23:34:55,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 23:34:55,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 23:34:55,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 23:34:55,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 23:34:55,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 23:34:55,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 23:34:55,020 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 -> 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 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 [2024-09-12 23:34:55,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 23:34:55,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 23:34:55,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 23:34:55,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 23:34:55,306 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 23:34:55,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2024-09-12 23:34:56,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 23:34:56,800 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 23:34:56,800 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2024-09-12 23:34:56,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5110c1a5b/53e17120aef24a2ab716ffe492a7f178/FLAG083d18775 [2024-09-12 23:34:56,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5110c1a5b/53e17120aef24a2ab716ffe492a7f178 [2024-09-12 23:34:56,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 23:34:56,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 23:34:56,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 23:34:56,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 23:34:56,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 23:34:56,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:34:56" (1/1) ... [2024-09-12 23:34:56,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d10227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:56, skipping insertion in model container [2024-09-12 23:34:56,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:34:56" (1/1) ... [2024-09-12 23:34:56,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 23:34:56,990 WARN L247 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_valuebound2.c[525,538] [2024-09-12 23:34:57,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:34:57,033 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 23:34:57,047 WARN L247 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_valuebound2.c[525,538] [2024-09-12 23:34:57,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:34:57,075 INFO L204 MainTranslator]: Completed translation [2024-09-12 23:34:57,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57 WrapperNode [2024-09-12 23:34:57,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 23:34:57,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 23:34:57,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 23:34:57,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 23:34:57,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,104 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 23:34:57,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 23:34:57,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 23:34:57,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 23:34:57,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 23:34:57,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,137 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-12 23:34:57,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 23:34:57,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 23:34:57,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 23:34:57,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 23:34:57,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (1/1) ... [2024-09-12 23:34:57,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:34:57,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:34:57,179 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-12 23:34:57,182 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-12 23:34:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 23:34:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 23:34:57,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 23:34:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 23:34:57,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 23:34:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 23:34:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 23:34:57,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 23:34:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 23:34:57,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 23:34:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 23:34:57,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 23:34:57,288 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 23:34:57,290 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 23:34:57,553 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 23:34:57,553 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 23:34:57,570 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 23:34:57,570 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 23:34:57,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:34:57 BoogieIcfgContainer [2024-09-12 23:34:57,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 23:34:57,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 23:34:57,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 23:34:57,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 23:34:57,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 11:34:56" (1/3) ... [2024-09-12 23:34:57,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c120c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:34:57, skipping insertion in model container [2024-09-12 23:34:57,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:34:57" (2/3) ... [2024-09-12 23:34:57,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c120c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:34:57, skipping insertion in model container [2024-09-12 23:34:57,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:34:57" (3/3) ... [2024-09-12 23:34:57,580 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2024-09-12 23:34:57,595 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 23:34:57,596 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 23:34:57,657 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 23:34:57,663 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;@4fee7305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 23:34:57,663 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 23:34:57,667 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-12 23:34:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 23:34:57,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:34:57,675 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-12 23:34:57,676 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:34:57,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-12 23:34:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:34:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693137160] [2024-09-12 23:34:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:34:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:57,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:34:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:57,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:34:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:57,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:34:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:57,850 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-12 23:34:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:57,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693137160] [2024-09-12 23:34:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693137160] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:34:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:34:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 23:34:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681094653] [2024-09-12 23:34:57,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:34:57,857 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 23:34:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:34:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 23:34:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 23:34:57,876 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-12 23:34:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:34:57,901 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-12 23:34:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 23:34:57,903 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-12 23:34:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:34:57,908 INFO L225 Difference]: With dead ends: 66 [2024-09-12 23:34:57,908 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 23:34:57,911 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-12 23:34:57,914 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-12 23:34:57,914 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-12 23:34:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 23:34:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 23:34:57,941 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-12 23:34:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-12 23:34:57,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-12 23:34:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:34:57,945 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-12 23:34:57,945 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-12 23:34:57,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-12 23:34:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 23:34:57,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:34:57,947 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-12 23:34:57,947 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 23:34:57,948 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:34:57,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:34:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-12 23:34:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:34:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676664079] [2024-09-12 23:34:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:34:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:34:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:58,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:34:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:58,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:34:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:58,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:34:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:34:58,507 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-12 23:34:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:34:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676664079] [2024-09-12 23:34:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676664079] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:34:58,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:34:58,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 23:34:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524921765] [2024-09-12 23:34:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:34:58,510 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 23:34:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:34:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 23:34:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 23:34:58,514 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-12 23:34:59,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:35:03,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:35:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:35:03,890 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-12 23:35:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 23:35:03,892 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-12 23:35:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:35:03,893 INFO L225 Difference]: With dead ends: 64 [2024-09-12 23:35:03,893 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 23:35:03,894 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-12 23:35:03,895 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-09-12 23:35:03,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-09-12 23:35:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 23:35:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-12 23:35:03,912 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-12 23:35:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-12 23:35:03,914 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-12 23:35:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:35:03,914 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-12 23:35:03,914 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-12 23:35:03,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-12 23:35:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 23:35:03,916 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:35:03,916 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-12 23:35:03,916 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 23:35:03,917 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:35:03,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-12 23:35:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:35:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125024258] [2024-09-12 23:35:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:35:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:04,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:35:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:04,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:35:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:04,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:35:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:04,343 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-12 23:35:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:35:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125024258] [2024-09-12 23:35:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125024258] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:35:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333696501] [2024-09-12 23:35:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:04,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:35:04,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:35:04,349 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-12 23:35:04,353 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-12 23:35:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:04,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 23:35:04,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:35:04,592 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-12 23:35:04,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:35:04,788 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-12 23:35:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333696501] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:35:04,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:35:04,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-12 23:35:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606229072] [2024-09-12 23:35:04,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:35:04,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 23:35:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:35:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 23:35:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:35:04,793 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-12 23:35:09,902 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-12 23:35:13,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:35:17,931 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-12 23:35:22,024 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-12 23:35:26,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:35:30,063 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-12 23:35:34,521 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-12 23:35:38,936 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-12 23:35:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:35:39,700 INFO L93 Difference]: Finished difference Result 137 states and 220 transitions. [2024-09-12 23:35:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 23:35:39,701 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-12 23:35:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:35:39,704 INFO L225 Difference]: With dead ends: 137 [2024-09-12 23:35:39,707 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 23:35:39,708 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-09-12 23:35:39,709 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 137 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2024-09-12 23:35:39,711 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 398 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 287 Invalid, 8 Unknown, 0 Unchecked, 34.7s Time] [2024-09-12 23:35:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 23:35:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2024-09-12 23:35:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 states have internal predecessors, (48), 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-12 23:35:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-09-12 23:35:39,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 25 [2024-09-12 23:35:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:35:39,744 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-09-12 23:35:39,744 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-12 23:35:39,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-09-12 23:35:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 23:35:39,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:35:39,748 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-12 23:35:39,765 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 23:35:39,949 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-12 23:35:39,949 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:35:39,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-12 23:35:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:35:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416068939] [2024-09-12 23:35:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:35:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:35:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042605853] [2024-09-12 23:35:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:35:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:35:39,988 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-12 23:35:39,990 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-12 23:35:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 23:35:40,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:35:40,110 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-12 23:35:40,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:35:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:35:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416068939] [2024-09-12 23:35:40,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:35:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042605853] [2024-09-12 23:35:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042605853] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:35:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:35:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 23:35:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12973839] [2024-09-12 23:35:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:35:40,112 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:35:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:35:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:35:40,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:35:40,114 INFO L87 Difference]: Start difference. First operand 71 states and 100 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-12 23:35:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:35:40,366 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2024-09-12 23:35:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:35:40,367 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-12 23:35:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:35:40,369 INFO L225 Difference]: With dead ends: 98 [2024-09-12 23:35:40,371 INFO L226 Difference]: Without dead ends: 95 [2024-09-12 23:35:40,372 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-12 23:35:40,372 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 23:35:40,374 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-12 23:35:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-12 23:35:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-12 23:35:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 50 states have internal predecessors, (58), 40 states have call successors, (40), 8 states have call predecessors, (40), 7 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-12 23:35:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-09-12 23:35:40,402 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 33 [2024-09-12 23:35:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:35:40,403 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-09-12 23:35:40,403 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-12 23:35:40,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-09-12 23:35:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 23:35:40,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:35:40,405 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-12 23:35:40,422 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 23:35:40,609 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-12 23:35:40,610 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:35:40,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-12 23:35:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:35:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019520498] [2024-09-12 23:35:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:35:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:35:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:35:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:35:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 23:35:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 23:35:40,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:35:40,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019520498] [2024-09-12 23:35:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019520498] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:35:40,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927829390] [2024-09-12 23:35:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:40,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:35:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:35:40,816 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-12 23:35:40,822 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-12 23:35:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:40,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 23:35:40,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:35:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 23:35:40,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:35:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 23:35:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927829390] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:35:41,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:35:41,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-12 23:35:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395363966] [2024-09-12 23:35:41,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:35:41,064 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 23:35:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:35:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 23:35:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 23:35:41,065 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 23:35:42,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:35:46,643 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-12 23:35:51,540 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-12 23:35:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:35:51,656 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2024-09-12 23:35:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 23:35:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2024-09-12 23:35:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:35:51,658 INFO L225 Difference]: With dead ends: 124 [2024-09-12 23:35:51,658 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 23:35:51,659 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-12 23:35:51,659 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:35:51,660 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 320 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-09-12 23:35:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 23:35:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-09-12 23:35:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 33 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-12 23:35:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-09-12 23:35:51,680 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 32 [2024-09-12 23:35:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:35:51,680 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-09-12 23:35:51,681 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 23:35:51,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2024-09-12 23:35:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 23:35:51,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:35:51,684 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-12 23:35:51,699 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-12 23:35:51,884 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-12 23:35:51,884 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:35:51,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-12 23:35:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:35:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166145657] [2024-09-12 23:35:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:35:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:35:51,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360576735] [2024-09-12 23:35:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:51,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:35:51,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:35:51,922 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-12 23:35:51,924 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-12 23:35:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:51,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 23:35:51,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:35:52,136 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-12 23:35:52,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:35:56,385 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-12 23:35:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:35:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166145657] [2024-09-12 23:35:56,390 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:35:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360576735] [2024-09-12 23:35:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360576735] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:35:56,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 23:35:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-12 23:35:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246025214] [2024-09-12 23:35:56,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 23:35:56,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 23:35:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:35:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 23:35:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-12 23:35:56,393 INFO L87 Difference]: Start difference. First operand 75 states and 100 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-12 23:35:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:35:56,980 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2024-09-12 23:35:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:35:56,980 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-12 23:35:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:35:56,983 INFO L225 Difference]: With dead ends: 89 [2024-09-12 23:35:56,983 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 23:35:56,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-12 23:35:56,984 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:35:56,985 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 133 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 23:35:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 23:35:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-12 23:35:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (26), 8 states have call predecessors, (26), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-12 23:35:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-12 23:35:57,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 59 [2024-09-12 23:35:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:35:57,011 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-12 23:35:57,011 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-12 23:35:57,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-12 23:35:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 23:35:57,013 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:35:57,013 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-12 23:35:57,032 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 23:35:57,218 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-12 23:35:57,219 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:35:57,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:35:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-12 23:35:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:35:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293177680] [2024-09-12 23:35:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:57,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:35:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:35:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:35:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:35:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 23:35:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 23:35:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 23:35:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 23:35:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 23:35:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 23:35:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,244 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-12 23:35:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:35:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293177680] [2024-09-12 23:35:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293177680] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:35:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969811364] [2024-09-12 23:35:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:35:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:35:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:35:58,247 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-12 23:35:58,251 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-12 23:35:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:35:58,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-09-12 23:35:58,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:35:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-12 23:35:59,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:36:27,122 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:36:41,014 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~q~0 4294967296))) (let ((.cse0 (mod c_main_~r~0 4294967296)) (.cse1 (div .cse3 4))) (or (< .cse0 (mod (+ c_main_~p~0 .cse1) 4294967296)) (< (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296) (+ 1 .cse0)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (let ((.cse2 (* 2 (div (mod c_main_~p~0 4294967296) 2)))) (< (+ (* (div (+ (* 3 .cse1) .cse2) 4294967296) 4294967296) c_main_~r~0) (+ (* 4 .cse1) (* 4294967296 (div (+ (* (- 1) .cse1) (* (- 1) c_main_~p~0) c_main_~r~0) 4294967296)) c_main_~p~0 .cse2))) (= .cse3 1)))) is different from true [2024-09-12 23:36:53,439 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:37:01,608 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:37:42,986 WARN L293 SmtUtils]: Spent 24.22s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:38:03,652 WARN L293 SmtUtils]: Spent 16.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:38:15,741 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:38:23,851 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:38:35,965 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:38:48,319 WARN L293 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:38:52,354 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~q~0 1073741824))) (let ((.cse0 (mod c_main_~r~0 4294967296)) (.cse3 (* 4 .cse1)) (.cse4 (mod c_main_~n~0 4294967296))) (or (< (* (mod (+ c_main_~p~0 (* c_main_~q~0 2)) 2147483648) 2) (+ 1 .cse0)) (< .cse0 (mod (+ c_main_~p~0 .cse1) 4294967296)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 c_main_~p~0 4294967280) (* c_main_~q~0 c_main_~p~0 c_main_~r~0 4294967280) (* c_main_~q~0 c_main_~n~0 4294967280 c_main_~h~0) (* c_main_~q~0 16 c_main_~r~0 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 16 c_main_~p~0 c_main_~n~0)) 4294967296) 0)) (let ((.cse2 (* 2 (div (mod c_main_~p~0 4294967296) 2)))) (< (+ (* (div (+ (* 3 .cse1) .cse2) 4294967296) 4294967296) c_main_~r~0) (+ .cse3 c_main_~p~0 (* (div (+ (* (- 1) .cse1) (* (- 1) c_main_~p~0) c_main_~r~0) 4294967296) 4294967296) .cse2))) (< .cse4 (mod c_main_~q~0 4294967296)) (< .cse3 (+ .cse4 1))))) is different from true [2024-09-12 23:39:08,440 WARN L293 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:39:16,489 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:39:32,546 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:39:44,633 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:39:52,722 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:04,774 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:40:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 4 not checked. [2024-09-12 23:40:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969811364] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:40:04,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:40:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 28 [2024-09-12 23:40:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604573026] [2024-09-12 23:40:04,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:40:04,835 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-12 23:40:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:40:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-12 23:40:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=546, Unknown=4, NotChecked=98, Total=756 [2024-09-12 23:40:04,837 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 10 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-12 23:40:09,641 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-12 23:40:13,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:40:17,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:40:21,684 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-12 23:40:25,707 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-12 23:40:29,723 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-12 23:40:33,751 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-12 23:40:38,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:40:42,643 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-12 23:40:43,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:40:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:40:43,960 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-09-12 23:40:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 23:40:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 10 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 58 [2024-09-12 23:40:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:40:43,961 INFO L225 Difference]: With dead ends: 83 [2024-09-12 23:40:43,961 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 23:40:43,962 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=139, Invalid=735, Unknown=4, NotChecked=114, Total=992 [2024-09-12 23:40:43,962 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 30 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 38.8s IncrementalHoareTripleChecker+Time [2024-09-12 23:40:43,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 410 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 440 Invalid, 9 Unknown, 118 Unchecked, 38.8s Time] [2024-09-12 23:40:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 23:40:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-12 23:40:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:40:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-09-12 23:40:43,979 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 58 [2024-09-12 23:40:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:40:43,980 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-09-12 23:40:43,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 10 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-12 23:40:43,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:40:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-09-12 23:40:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 23:40:43,981 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:40:43,981 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 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] [2024-09-12 23:40:43,997 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 23:40:44,182 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-12 23:40:44,182 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:40:44,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:40:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1865017153, now seen corresponding path program 2 times [2024-09-12 23:40:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:40:44,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340902863] [2024-09-12 23:40:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:40:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:40:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:40:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547771011] [2024-09-12 23:40:44,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:40:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:40:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:40:44,215 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-12 23:40:44,216 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-12 23:40:44,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:40:44,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:40:44,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-12 23:40:44,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:40:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-12 23:40:45,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:41:03,231 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:27,623 WARN L293 SmtUtils]: Spent 24.39s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:41:44,290 WARN L293 SmtUtils]: Spent 16.67s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:42:46,477 WARN L293 SmtUtils]: Spent 48.36s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:42:58,627 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:26,714 WARN L293 SmtUtils]: Spent 28.09s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:39,722 WARN L293 SmtUtils]: Spent 13.01s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:43:55,835 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:14,614 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:26,633 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:32,781 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:40,429 WARN L293 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:45:08,466 WARN L293 SmtUtils]: Spent 28.04s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:46:53,455 WARN L293 SmtUtils]: Spent 1.24m on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:47:06,787 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:47:15,086 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:47:38,914 WARN L293 SmtUtils]: Spent 19.44s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:00,625 WARN L293 SmtUtils]: Spent 21.71s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:14,151 WARN L293 SmtUtils]: Spent 13.51s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:19,617 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:25,560 WARN L293 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:40,070 WARN L293 SmtUtils]: Spent 14.51s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:48:53,067 WARN L293 SmtUtils]: Spent 13.00s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:49:09,098 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:49:24,067 WARN L293 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15