./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.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 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:49:35,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:49:35,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:49:35,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:49:35,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:49:35,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:49:35,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:49:35,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:49:35,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:49:35,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:49:35,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:49:35,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:49:35,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:49:35,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:49:35,947 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:49:35,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:49:35,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:49:35,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:49:35,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:49:35,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:49:35,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:49:35,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:49:35,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:49:35,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:49:35,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:49:35,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:49:35,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:49:35,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:49:35,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:49:35,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:49:35,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:49:35,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:49:35,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:49:35,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:49:35,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:49:35,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:49:35,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:49:35,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:49:35,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:49:35,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:49:35,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:49:35,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:49:35,961 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 -> 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:49:36,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:49:36,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:49:36,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:49:36,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:49:36,243 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:49:36,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-24 23:49:37,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:49:37,928 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:49:37,929 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-24 23:49:37,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/54dbe37aa/55a9c62cf3314d248182f8116f9f9fa3/FLAG43daeb02b [2024-09-24 23:49:37,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/54dbe37aa/55a9c62cf3314d248182f8116f9f9fa3 [2024-09-24 23:49:37,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:49:37,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:49:37,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:49:37,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:49:37,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:49:37,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:49:37" (1/1) ... [2024-09-24 23:49:37,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc6606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:37, skipping insertion in model container [2024-09-24 23:49:37,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:49:37" (1/1) ... [2024-09-24 23:49:37,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:49:38,133 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2024-09-24 23:49:38,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:49:38,159 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:49:38,170 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2024-09-24 23:49:38,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:49:38,197 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:49:38,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38 WrapperNode [2024-09-24 23:49:38,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:49:38,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:49:38,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:49:38,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:49:38,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,218 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:49:38,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:49:38,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:49:38,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:49:38,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:49:38,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,243 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-24 23:49:38,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:49:38,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:49:38,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:49:38,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:49:38,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (1/1) ... [2024-09-24 23:49:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:49:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:38,292 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-24 23:49:38,296 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-24 23:49:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:49:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:49:38,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:49:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:49:38,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:49:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:49:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:49:38,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:49:38,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:49:38,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:49:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:49:38,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:49:38,412 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:49:38,414 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:49:38,607 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:49:38,607 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:49:38,633 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:49:38,634 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:49:38,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:49:38 BoogieIcfgContainer [2024-09-24 23:49:38,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:49:38,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:49:38,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:49:38,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:49:38,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:49:37" (1/3) ... [2024-09-24 23:49:38,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec0590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:49:38, skipping insertion in model container [2024-09-24 23:49:38,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:38" (2/3) ... [2024-09-24 23:49:38,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec0590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:49:38, skipping insertion in model container [2024-09-24 23:49:38,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:49:38" (3/3) ... [2024-09-24 23:49:38,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2024-09-24 23:49:38,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:49:38,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:49:38,725 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:49:38,736 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;@30557626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:49:38,737 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:49:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-24 23:49:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:49:38,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:38,759 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:38,759 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:38,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-24 23:49:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773191207] [2024-09-24 23:49:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:38,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:38,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:38,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:38,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:49:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773191207] [2024-09-24 23:49:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773191207] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:39,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:49:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804777268] [2024-09-24 23:49:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:39,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:49:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:49:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:49:39,029 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:49:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:39,054 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-24 23:49:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:49:39,056 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-24 23:49:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:39,063 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:49:39,063 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:49:39,066 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-24 23:49:39,069 INFO L434 NwaCegarLoop]: 44 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, 44 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-24 23:49:39,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:49:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:49:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-24 23:49:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:49:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-24 23:49:39,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-24 23:49:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:39,114 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-24 23:49:39,114 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-24 23:49:39,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-24 23:49:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:49:39,117 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:39,118 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:39,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:49:39,118 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:39,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-24 23:49:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559922325] [2024-09-24 23:49:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:49:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559922325] [2024-09-24 23:49:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559922325] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364599732] [2024-09-24 23:49:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:39,539 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:39,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:39,541 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-24 23:49:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:39,631 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-24 23:49:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-24 23:49:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:39,633 INFO L225 Difference]: With dead ends: 45 [2024-09-24 23:49:39,633 INFO L226 Difference]: Without dead ends: 43 [2024-09-24 23:49:39,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-24 23:49:39,635 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:39,636 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:49:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-24 23:49:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-24 23:49:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:49:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-24 23:49:39,655 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-24 23:49:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:39,655 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-24 23:49:39,656 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-24 23:49:39,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-24 23:49:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:49:39,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:39,657 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:39,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:49:39,657 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:39,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-24 23:49:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379206020] [2024-09-24 23:49:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:39,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:49:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379206020] [2024-09-24 23:49:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379206020] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:40,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:40,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119790711] [2024-09-24 23:49:40,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:40,029 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:40,030 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-24 23:49:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:40,162 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-24 23:49:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 32 [2024-09-24 23:49:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:40,164 INFO L225 Difference]: With dead ends: 49 [2024-09-24 23:49:40,164 INFO L226 Difference]: Without dead ends: 47 [2024-09-24 23:49:40,164 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-24 23:49:40,165 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:40,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:49:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-24 23:49:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-24 23:49:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:49:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-24 23:49:40,180 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-24 23:49:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:40,182 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-24 23:49:40,183 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-24 23:49:40,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-24 23:49:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-24 23:49:40,184 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:40,185 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:40,185 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:49:40,186 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:40,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:40,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-24 23:49:40,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:40,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010219675] [2024-09-24 23:49:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927338402] [2024-09-24 23:49:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:40,223 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-24 23:49:40,225 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-24 23:49:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:40,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-24 23:49:40,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-24 23:49:40,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:49:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010219675] [2024-09-24 23:49:40,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:40,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927338402] [2024-09-24 23:49:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927338402] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 23:49:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552134853] [2024-09-24 23:49:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:40,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:49:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:49:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:49:40,471 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:49:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:40,688 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-24 23:49:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:49:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-24 23:49:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:40,691 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:49:40,692 INFO L226 Difference]: Without dead ends: 53 [2024-09-24 23:49:40,693 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:49:40,694 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:40,697 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:49:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-24 23:49:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-24 23:49:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-24 23:49:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-24 23:49:40,722 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-24 23:49:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:40,723 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-24 23:49:40,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:49:40,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-24 23:49:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:49:40,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:40,725 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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-24 23:49:40,743 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:49:40,926 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:40,927 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:40,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-24 23:49:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849124854] [2024-09-24 23:49:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [955856037] [2024-09-24 23:49:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:40,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:40,975 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-24 23:49:40,980 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-24 23:49:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:41,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-24 23:49:41,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:49:41,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-24 23:49:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:42,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849124854] [2024-09-24 23:49:42,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955856037] [2024-09-24 23:49:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955856037] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:42,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-24 23:49:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399057888] [2024-09-24 23:49:42,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:42,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-24 23:49:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-24 23:49:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-24 23:49:42,478 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-24 23:49:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:43,108 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-24 23:49:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 23:49:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-24 23:49:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:43,111 INFO L225 Difference]: With dead ends: 71 [2024-09-24 23:49:43,112 INFO L226 Difference]: Without dead ends: 63 [2024-09-24 23:49:43,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-24 23:49:43,114 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:43,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-24 23:49:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-24 23:49:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-24 23:49:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-24 23:49:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-24 23:49:43,136 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-24 23:49:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:43,136 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-24 23:49:43,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-24 23:49:43,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-24 23:49:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-24 23:49:43,138 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:43,138 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:43,156 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:49:43,344 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:43,345 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:43,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-24 23:49:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358735616] [2024-09-24 23:49:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235014535] [2024-09-24 23:49:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:43,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:43,393 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-24 23:49:43,394 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-24 23:49:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:43,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-24 23:49:43,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-24 23:49:43,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-24 23:49:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358735616] [2024-09-24 23:49:44,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235014535] [2024-09-24 23:49:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235014535] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:44,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-09-24 23:49:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443657553] [2024-09-24 23:49:44,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:44,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-24 23:49:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-24 23:49:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-09-24 23:49:44,495 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-24 23:49:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:45,941 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-09-24 23:49:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 23:49:45,942 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) Word has length 54 [2024-09-24 23:49:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:45,943 INFO L225 Difference]: With dead ends: 90 [2024-09-24 23:49:45,943 INFO L226 Difference]: Without dead ends: 82 [2024-09-24 23:49:45,944 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-09-24 23:49:45,944 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:45,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 240 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-09-24 23:49:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-24 23:49:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-09-24 23:49:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-24 23:49:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2024-09-24 23:49:45,975 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 54 [2024-09-24 23:49:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:45,975 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2024-09-24 23:49:45,976 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-24 23:49:45,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2024-09-24 23:49:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-24 23:49:45,978 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:45,978 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:45,986 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-24 23:49:46,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-24 23:49:46,179 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:46,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-24 23:49:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868506012] [2024-09-24 23:49:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444566304] [2024-09-24 23:49:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:46,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:46,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:46,238 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-24 23:49:46,245 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-24 23:49:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:46,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-24 23:49:46,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-24 23:49:47,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:50:33,577 WARN L293 SmtUtils]: Spent 12.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:50:42,752 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse3 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< (mod c_main_~r~0 4294967296) .cse3) (= .cse4 1) (= .cse0 (mod (+ (* 4294967295 .cse3) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2))) 4294967296))))) is different from true [2024-09-24 23:51:03,082 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:51:19,104 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:51:31,133 WARN L293 SmtUtils]: Spent 8.02s 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-24 23:51:47,171 WARN L293 SmtUtils]: Spent 16.02s 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-24 23:52:11,197 WARN L293 SmtUtils]: Spent 24.03s 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-24 23:52:24,062 WARN L293 SmtUtils]: Spent 8.01s 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-24 23:52:28,066 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse3 (mod c_main_~p~0 4294967296)) (.cse2 (div (mod (* c_main_~p~0 c_main_~B~0) 4294967296) 2))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (< (mod c_main_~r~0 4294967296) .cse2) (= .cse3 1) (= .cse0 (mod (+ c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse3 2)) (* .cse2 4294967295)) 4294967296)))) is different from true [2024-09-24 23:52:44,097 WARN L293 SmtUtils]: Spent 16.02s 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-24 23:53:09,170 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:53:18,311 WARN L293 SmtUtils]: Spent 8.04s 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-24 23:53:22,323 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~r~0 4294967296)) (.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296)) (.cse3 (div (mod (* c_main_~p~0 c_main_~B~0) 4294967296) 2))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (< .cse2 .cse3) (not (= .cse0 .cse2)) (= .cse4 1) (= .cse0 (mod (+ c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2)) (* .cse3 4294967295)) 4294967296)))) is different from true [2024-09-24 23:53:51,077 WARN L293 SmtUtils]: Spent 12.45s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:54:13,675 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)