./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:12:31,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:12:31,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:12:31,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:12:31,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:12:31,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:12:31,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:12:31,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:12:31,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:12:31,776 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:12:31,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:12:31,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:12:31,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:12:31,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:12:31,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:12:31,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:12:31,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:12:31,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:12:31,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:12:31,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:12:31,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:12:31,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:12:31,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:12:31,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:12:31,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:31,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:12:31,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:12:31,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:12:31,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:12:31,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:12:31,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:12:31,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:12:31,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:12:31,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:12:31,784 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd [2024-11-10 01:12:32,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:12:32,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:12:32,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:12:32,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:12:32,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:12:32,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:33,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:12:33,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:12:33,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:33,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd6f9ea0/e095ce9bb08e4c7d9f78f1280ce40805/FLAG058224356 [2024-11-10 01:12:33,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd6f9ea0/e095ce9bb08e4c7d9f78f1280ce40805 [2024-11-10 01:12:33,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:12:33,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:12:33,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:33,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:12:33,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:12:33,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:33" (1/1) ... [2024-11-10 01:12:33,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bacba15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:33, skipping insertion in model container [2024-11-10 01:12:33,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:33" (1/1) ... [2024-11-10 01:12:33,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:12:33,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:33,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:33,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:12:33,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:34,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:34,095 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:12:34,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34 WrapperNode [2024-11-10 01:12:34,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:34,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:34,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:12:34,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:12:34,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,288 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2024-11-10 01:12:34,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:34,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:12:34,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:12:34,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:12:34,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,385 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-11-10 01:12:34,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:12:34,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:12:34,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:12:34,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:12:34,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (1/1) ... [2024-11-10 01:12:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:12:34,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:12:34,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:12:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:12:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:12:34,704 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:12:34,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:12:36,299 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2024-11-10 01:12:36,299 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:12:36,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:12:36,386 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-10 01:12:36,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:36 BoogieIcfgContainer [2024-11-10 01:12:36,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:12:36,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:12:36,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:12:36,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:12:36,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:12:33" (1/3) ... [2024-11-10 01:12:36,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9628f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:36, skipping insertion in model container [2024-11-10 01:12:36,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:34" (2/3) ... [2024-11-10 01:12:36,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9628f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:36, skipping insertion in model container [2024-11-10 01:12:36,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:36" (3/3) ... [2024-11-10 01:12:36,396 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:36,411 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:12:36,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:12:36,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:12:36,485 INFO L333 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=LoopHeads, 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;@b0de9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:12:36,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:12:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 600 states, 598 states have (on average 1.5) internal successors, (897), 599 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 01:12:36,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:36,502 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-10 01:12:36,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 269099986, now seen corresponding path program 1 times [2024-11-10 01:12:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:36,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208185440] [2024-11-10 01:12:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:36,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208185440] [2024-11-10 01:12:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208185440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:36,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:36,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410602764] [2024-11-10 01:12:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:37,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:37,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:37,004 INFO L87 Difference]: Start difference. First operand has 600 states, 598 states have (on average 1.5) internal successors, (897), 599 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:37,335 INFO L93 Difference]: Finished difference Result 1153 states and 1728 transitions. [2024-11-10 01:12:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 01:12:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:37,350 INFO L225 Difference]: With dead ends: 1153 [2024-11-10 01:12:37,350 INFO L226 Difference]: Without dead ends: 595 [2024-11-10 01:12:37,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:37,357 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 859 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:37,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1472 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:12:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-10 01:12:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-10 01:12:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4983164983164983) internal successors, (890), 594 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 890 transitions. [2024-11-10 01:12:37,408 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 890 transitions. Word has length 60 [2024-11-10 01:12:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 890 transitions. [2024-11-10 01:12:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 890 transitions. [2024-11-10 01:12:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 01:12:37,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:37,410 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-10 01:12:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:12:37,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:37,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1085121744, now seen corresponding path program 1 times [2024-11-10 01:12:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317920017] [2024-11-10 01:12:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317920017] [2024-11-10 01:12:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317920017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:12:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128464413] [2024-11-10 01:12:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:12:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:12:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:12:37,551 INFO L87 Difference]: Start difference. First operand 595 states and 890 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:37,785 INFO L93 Difference]: Finished difference Result 1149 states and 1720 transitions. [2024-11-10 01:12:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:12:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 01:12:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:37,790 INFO L225 Difference]: With dead ends: 1149 [2024-11-10 01:12:37,790 INFO L226 Difference]: Without dead ends: 596 [2024-11-10 01:12:37,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:12:37,792 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 0 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:37,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1479 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-10 01:12:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2024-11-10 01:12:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2024-11-10 01:12:37,806 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 61 [2024-11-10 01:12:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2024-11-10 01:12:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2024-11-10 01:12:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 01:12:37,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:37,808 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-10 01:12:37,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:12:37,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:37,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1499853649, now seen corresponding path program 1 times [2024-11-10 01:12:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691473798] [2024-11-10 01:12:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691473798] [2024-11-10 01:12:37,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691473798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:37,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:37,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816251796] [2024-11-10 01:12:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:37,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:37,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:37,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:37,986 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:38,255 INFO L93 Difference]: Finished difference Result 601 states and 896 transitions. [2024-11-10 01:12:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:38,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 01:12:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:38,258 INFO L225 Difference]: With dead ends: 601 [2024-11-10 01:12:38,258 INFO L226 Difference]: Without dead ends: 598 [2024-11-10 01:12:38,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:38,259 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:38,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2218 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-10 01:12:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-11-10 01:12:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2024-11-10 01:12:38,273 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2024-11-10 01:12:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:38,273 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2024-11-10 01:12:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2024-11-10 01:12:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 01:12:38,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:38,275 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-10 01:12:38,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:12:38,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:38,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 894231340, now seen corresponding path program 1 times [2024-11-10 01:12:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:38,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104959071] [2024-11-10 01:12:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104959071] [2024-11-10 01:12:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104959071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447195268] [2024-11-10 01:12:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:38,401 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:38,672 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2024-11-10 01:12:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 01:12:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:38,675 INFO L225 Difference]: With dead ends: 1156 [2024-11-10 01:12:38,675 INFO L226 Difference]: Without dead ends: 600 [2024-11-10 01:12:38,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:38,676 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:38,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-10 01:12:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-10 01:12:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2024-11-10 01:12:38,686 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2024-11-10 01:12:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2024-11-10 01:12:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2024-11-10 01:12:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 01:12:38,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:38,688 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1] [2024-11-10 01:12:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:12:38,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1698612148, now seen corresponding path program 1 times [2024-11-10 01:12:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141179162] [2024-11-10 01:12:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141179162] [2024-11-10 01:12:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141179162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:38,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:38,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230765193] [2024-11-10 01:12:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:38,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:38,831 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:39,084 INFO L93 Difference]: Finished difference Result 1160 states and 1731 transitions. [2024-11-10 01:12:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 01:12:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:39,087 INFO L225 Difference]: With dead ends: 1160 [2024-11-10 01:12:39,087 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:12:39,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:39,090 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:39,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2210 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:12:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:12:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2024-11-10 01:12:39,103 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2024-11-10 01:12:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:39,104 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2024-11-10 01:12:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2024-11-10 01:12:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 01:12:39,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:39,108 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1] [2024-11-10 01:12:39,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:12:39,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -472934745, now seen corresponding path program 1 times [2024-11-10 01:12:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414694270] [2024-11-10 01:12:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414694270] [2024-11-10 01:12:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414694270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:12:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705637548] [2024-11-10 01:12:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:12:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:12:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:12:39,486 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:39,955 INFO L93 Difference]: Finished difference Result 1170 states and 1743 transitions. [2024-11-10 01:12:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:12:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 01:12:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:39,957 INFO L225 Difference]: With dead ends: 1170 [2024-11-10 01:12:39,957 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 01:12:39,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:12:39,959 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 850 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:39,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 3677 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:12:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 01:12:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2024-11-10 01:12:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.4925619834710744) internal successors, (903), 605 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 903 transitions. [2024-11-10 01:12:39,972 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 903 transitions. Word has length 64 [2024-11-10 01:12:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 903 transitions. [2024-11-10 01:12:39,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 903 transitions. [2024-11-10 01:12:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 01:12:39,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:39,977 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2024-11-10 01:12:39,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:12:39,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:39,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1557190215, now seen corresponding path program 1 times [2024-11-10 01:12:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804957952] [2024-11-10 01:12:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804957952] [2024-11-10 01:12:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804957952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:12:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005088602] [2024-11-10 01:12:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:12:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:40,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:12:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:40,139 INFO L87 Difference]: Start difference. First operand 606 states and 903 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:40,485 INFO L93 Difference]: Finished difference Result 1174 states and 1750 transitions. [2024-11-10 01:12:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:12:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 01:12:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:40,487 INFO L225 Difference]: With dead ends: 1174 [2024-11-10 01:12:40,488 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 01:12:40,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:40,489 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 4 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:40,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2939 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:12:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 01:12:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2024-11-10 01:12:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.4909390444810544) internal successors, (905), 607 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 905 transitions. [2024-11-10 01:12:40,499 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 905 transitions. Word has length 65 [2024-11-10 01:12:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:40,499 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 905 transitions. [2024-11-10 01:12:40,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 905 transitions. [2024-11-10 01:12:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 01:12:40,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:40,500 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2024-11-10 01:12:40,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:12:40,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1392481246, now seen corresponding path program 1 times [2024-11-10 01:12:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290659015] [2024-11-10 01:12:40,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:40,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290659015] [2024-11-10 01:12:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290659015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:12:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783128147] [2024-11-10 01:12:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:40,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:12:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:12:40,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:12:40,630 INFO L87 Difference]: Start difference. First operand 608 states and 905 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:41,242 INFO L93 Difference]: Finished difference Result 1734 states and 2588 transitions. [2024-11-10 01:12:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:12:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 01:12:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:41,244 INFO L225 Difference]: With dead ends: 1734 [2024-11-10 01:12:41,245 INFO L226 Difference]: Without dead ends: 620 [2024-11-10 01:12:41,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:12:41,247 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 807 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:41,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 3724 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:12:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-10 01:12:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 615. [2024-11-10 01:12:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.490228013029316) internal successors, (915), 614 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 915 transitions. [2024-11-10 01:12:41,259 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 915 transitions. Word has length 66 [2024-11-10 01:12:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:41,260 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 915 transitions. [2024-11-10 01:12:41,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 915 transitions. [2024-11-10 01:12:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 01:12:41,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:41,264 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2024-11-10 01:12:41,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:12:41,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -472946082, now seen corresponding path program 1 times [2024-11-10 01:12:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593312482] [2024-11-10 01:12:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593312482] [2024-11-10 01:12:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593312482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:12:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897258192] [2024-11-10 01:12:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:12:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:12:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:41,407 INFO L87 Difference]: Start difference. First operand 615 states and 915 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:41,716 INFO L93 Difference]: Finished difference Result 1215 states and 1808 transitions. [2024-11-10 01:12:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:12:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 01:12:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:41,722 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 01:12:41,722 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 01:12:41,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:41,723 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 64 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:41,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2903 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:12:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 01:12:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-10 01:12:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4882995319812793) internal successors, (954), 641 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 954 transitions. [2024-11-10 01:12:41,759 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 954 transitions. Word has length 66 [2024-11-10 01:12:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 954 transitions. [2024-11-10 01:12:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 954 transitions. [2024-11-10 01:12:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:12:41,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:41,762 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-11-10 01:12:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:12:41,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2038852676, now seen corresponding path program 1 times [2024-11-10 01:12:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758562697] [2024-11-10 01:12:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758562697] [2024-11-10 01:12:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758562697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003882728] [2024-11-10 01:12:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:41,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:41,886 INFO L87 Difference]: Start difference. First operand 642 states and 954 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:42,177 INFO L93 Difference]: Finished difference Result 1217 states and 1810 transitions. [2024-11-10 01:12:42,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:12:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:42,179 INFO L225 Difference]: With dead ends: 1217 [2024-11-10 01:12:42,180 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 01:12:42,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:42,181 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 851 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:42,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1425 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:12:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 01:12:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-10 01:12:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4867394695787832) internal successors, (953), 641 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 953 transitions. [2024-11-10 01:12:42,194 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 953 transitions. Word has length 67 [2024-11-10 01:12:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:42,194 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 953 transitions. [2024-11-10 01:12:42,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 953 transitions. [2024-11-10 01:12:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:12:42,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:42,194 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-11-10 01:12:42,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:12:42,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:42,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2014162849, now seen corresponding path program 1 times [2024-11-10 01:12:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465081925] [2024-11-10 01:12:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465081925] [2024-11-10 01:12:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465081925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:12:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950643269] [2024-11-10 01:12:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:12:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:12:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:42,368 INFO L87 Difference]: Start difference. First operand 642 states and 953 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:42,650 INFO L93 Difference]: Finished difference Result 1214 states and 1805 transitions. [2024-11-10 01:12:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:12:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:42,652 INFO L225 Difference]: With dead ends: 1214 [2024-11-10 01:12:42,652 INFO L226 Difference]: Without dead ends: 641 [2024-11-10 01:12:42,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:42,654 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1675 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:42,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1400 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:12:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-10 01:12:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 635. [2024-11-10 01:12:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4810725552050472) internal successors, (939), 634 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 939 transitions. [2024-11-10 01:12:42,666 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 939 transitions. Word has length 67 [2024-11-10 01:12:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:42,666 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 939 transitions. [2024-11-10 01:12:42,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 939 transitions. [2024-11-10 01:12:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:12:42,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:42,667 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-11-10 01:12:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:12:42,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:42,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1923081580, now seen corresponding path program 1 times [2024-11-10 01:12:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814537116] [2024-11-10 01:12:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814537116] [2024-11-10 01:12:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814537116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791282359] [2024-11-10 01:12:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:42,808 INFO L87 Difference]: Start difference. First operand 635 states and 939 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:43,016 INFO L93 Difference]: Finished difference Result 1200 states and 1776 transitions. [2024-11-10 01:12:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:43,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:12:43,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:43,018 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 01:12:43,018 INFO L226 Difference]: Without dead ends: 634 [2024-11-10 01:12:43,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:43,019 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 844 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:43,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1463 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-10 01:12:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-11-10 01:12:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4802527646129542) internal successors, (937), 633 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 937 transitions. [2024-11-10 01:12:43,030 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 937 transitions. Word has length 67 [2024-11-10 01:12:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:43,031 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 937 transitions. [2024-11-10 01:12:43,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 937 transitions. [2024-11-10 01:12:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 01:12:43,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:43,031 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:12:43,032 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1328084302, now seen corresponding path program 1 times [2024-11-10 01:12:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075154656] [2024-11-10 01:12:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:43,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075154656] [2024-11-10 01:12:43,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075154656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:43,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:43,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:12:43,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914170517] [2024-11-10 01:12:43,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:43,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:12:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:12:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:12:43,383 INFO L87 Difference]: Start difference. First operand 634 states and 937 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:44,290 INFO L93 Difference]: Finished difference Result 1215 states and 1795 transitions. [2024-11-10 01:12:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:12:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 01:12:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:44,293 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 01:12:44,293 INFO L226 Difference]: Without dead ends: 650 [2024-11-10 01:12:44,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:12:44,295 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 858 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 6372 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:44,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 6372 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 01:12:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-10 01:12:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 645. [2024-11-10 01:12:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4751552795031055) internal successors, (950), 644 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 950 transitions. [2024-11-10 01:12:44,310 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 950 transitions. Word has length 68 [2024-11-10 01:12:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 950 transitions. [2024-11-10 01:12:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 950 transitions. [2024-11-10 01:12:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 01:12:44,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:44,312 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:12:44,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1818719624, now seen corresponding path program 1 times [2024-11-10 01:12:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713775573] [2024-11-10 01:12:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713775573] [2024-11-10 01:12:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713775573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:12:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488388886] [2024-11-10 01:12:44,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:12:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:44,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:12:44,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:12:44,498 INFO L87 Difference]: Start difference. First operand 645 states and 950 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:44,908 INFO L93 Difference]: Finished difference Result 1225 states and 1805 transitions. [2024-11-10 01:12:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:12:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 01:12:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:44,910 INFO L225 Difference]: With dead ends: 1225 [2024-11-10 01:12:44,910 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 01:12:44,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:12:44,911 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 9 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3606 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:44,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3606 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:12:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 01:12:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-10 01:12:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.4744186046511627) internal successors, (951), 645 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 951 transitions. [2024-11-10 01:12:44,920 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 951 transitions. Word has length 68 [2024-11-10 01:12:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:44,920 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 951 transitions. [2024-11-10 01:12:44,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 951 transitions. [2024-11-10 01:12:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:12:44,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:44,921 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:12:44,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1810364867, now seen corresponding path program 1 times [2024-11-10 01:12:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382565740] [2024-11-10 01:12:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382565740] [2024-11-10 01:12:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382565740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:45,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:45,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:12:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038031993] [2024-11-10 01:12:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:45,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:12:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:12:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:12:45,240 INFO L87 Difference]: Start difference. First operand 646 states and 951 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:46,001 INFO L93 Difference]: Finished difference Result 1234 states and 1816 transitions. [2024-11-10 01:12:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:12:46,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 01:12:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:46,004 INFO L225 Difference]: With dead ends: 1234 [2024-11-10 01:12:46,004 INFO L226 Difference]: Without dead ends: 657 [2024-11-10 01:12:46,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:12:46,011 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 866 mSDsluCounter, 4954 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:46,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 5679 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:12:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-10 01:12:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 649. [2024-11-10 01:12:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4737654320987654) internal successors, (955), 648 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 955 transitions. [2024-11-10 01:12:46,022 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 955 transitions. Word has length 69 [2024-11-10 01:12:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:46,022 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 955 transitions. [2024-11-10 01:12:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 955 transitions. [2024-11-10 01:12:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 01:12:46,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:46,023 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:12:46,024 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1404059277, now seen corresponding path program 1 times [2024-11-10 01:12:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137021518] [2024-11-10 01:12:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137021518] [2024-11-10 01:12:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137021518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:12:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648778148] [2024-11-10 01:12:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:12:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:12:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:46,194 INFO L87 Difference]: Start difference. First operand 649 states and 955 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:46,645 INFO L93 Difference]: Finished difference Result 1238 states and 1820 transitions. [2024-11-10 01:12:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:12:46,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 01:12:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:46,648 INFO L225 Difference]: With dead ends: 1238 [2024-11-10 01:12:46,648 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 01:12:46,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:46,650 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 6 mSDsluCounter, 4306 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:46,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5027 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:12:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 01:12:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2024-11-10 01:12:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.4702290076335878) internal successors, (963), 655 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 963 transitions. [2024-11-10 01:12:46,662 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 963 transitions. Word has length 70 [2024-11-10 01:12:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 963 transitions. [2024-11-10 01:12:46,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 963 transitions. [2024-11-10 01:12:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 01:12:46,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:46,663 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:46,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:12:46,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1454501751, now seen corresponding path program 1 times [2024-11-10 01:12:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615205616] [2024-11-10 01:12:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615205616] [2024-11-10 01:12:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615205616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:46,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:12:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542297366] [2024-11-10 01:12:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:46,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:12:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:12:46,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:12:46,846 INFO L87 Difference]: Start difference. First operand 656 states and 963 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:47,555 INFO L93 Difference]: Finished difference Result 1775 states and 2607 transitions. [2024-11-10 01:12:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:12:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 01:12:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:47,558 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 01:12:47,558 INFO L226 Difference]: Without dead ends: 1188 [2024-11-10 01:12:47,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:12:47,560 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 797 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:47,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2183 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:12:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-11-10 01:12:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 709. [2024-11-10 01:12:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4533898305084745) internal successors, (1029), 708 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1029 transitions. [2024-11-10 01:12:47,573 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1029 transitions. Word has length 70 [2024-11-10 01:12:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:47,573 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1029 transitions. [2024-11-10 01:12:47,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1029 transitions. [2024-11-10 01:12:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 01:12:47,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:47,574 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:47,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:12:47,574 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:47,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1630316229, now seen corresponding path program 1 times [2024-11-10 01:12:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671732624] [2024-11-10 01:12:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671732624] [2024-11-10 01:12:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671732624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:47,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:47,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:12:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184735552] [2024-11-10 01:12:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:12:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:12:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:12:47,926 INFO L87 Difference]: Start difference. First operand 709 states and 1029 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:48,835 INFO L93 Difference]: Finished difference Result 1842 states and 2701 transitions. [2024-11-10 01:12:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:12:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 01:12:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:48,839 INFO L225 Difference]: With dead ends: 1842 [2024-11-10 01:12:48,840 INFO L226 Difference]: Without dead ends: 1236 [2024-11-10 01:12:48,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:12:48,841 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 2320 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 4850 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:48,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 4850 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 01:12:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-11-10 01:12:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 725. [2024-11-10 01:12:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4433701657458564) internal successors, (1045), 724 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1045 transitions. [2024-11-10 01:12:48,851 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1045 transitions. Word has length 71 [2024-11-10 01:12:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1045 transitions. [2024-11-10 01:12:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1045 transitions. [2024-11-10 01:12:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 01:12:48,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:48,852 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:12:48,853 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:48,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 440692081, now seen corresponding path program 1 times [2024-11-10 01:12:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812435982] [2024-11-10 01:12:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812435982] [2024-11-10 01:12:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812435982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:49,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:12:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807937331] [2024-11-10 01:12:49,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:12:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:49,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:12:49,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:49,165 INFO L87 Difference]: Start difference. First operand 725 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:49,718 INFO L93 Difference]: Finished difference Result 1331 states and 1929 transitions. [2024-11-10 01:12:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:12:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-10 01:12:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:49,721 INFO L225 Difference]: With dead ends: 1331 [2024-11-10 01:12:49,721 INFO L226 Difference]: Without dead ends: 736 [2024-11-10 01:12:49,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:12:49,723 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 826 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:49,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 3519 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:12:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-10 01:12:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2024-11-10 01:12:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4433701657458564) internal successors, (1045), 724 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1045 transitions. [2024-11-10 01:12:49,735 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1045 transitions. Word has length 72 [2024-11-10 01:12:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:49,736 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1045 transitions. [2024-11-10 01:12:49,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1045 transitions. [2024-11-10 01:12:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:12:49,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:49,736 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:49,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:12:49,737 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1467425234, now seen corresponding path program 1 times [2024-11-10 01:12:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306273616] [2024-11-10 01:12:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306273616] [2024-11-10 01:12:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306273616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:49,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:49,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:12:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881765951] [2024-11-10 01:12:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:12:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:12:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:50,000 INFO L87 Difference]: Start difference. First operand 725 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:50,565 INFO L93 Difference]: Finished difference Result 1359 states and 1963 transitions. [2024-11-10 01:12:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:12:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:12:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:50,567 INFO L225 Difference]: With dead ends: 1359 [2024-11-10 01:12:50,567 INFO L226 Difference]: Without dead ends: 735 [2024-11-10 01:12:50,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:12:50,568 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 870 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:50,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 4169 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:12:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-10 01:12:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-11-10 01:12:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4401650618982118) internal successors, (1047), 727 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1047 transitions. [2024-11-10 01:12:50,579 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1047 transitions. Word has length 73 [2024-11-10 01:12:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1047 transitions. [2024-11-10 01:12:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1047 transitions. [2024-11-10 01:12:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:12:50,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:50,580 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:12:50,580 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -934545917, now seen corresponding path program 1 times [2024-11-10 01:12:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651948537] [2024-11-10 01:12:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:50,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:50,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651948537] [2024-11-10 01:12:50,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651948537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:50,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:50,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:12:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348978713] [2024-11-10 01:12:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:50,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:12:50,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:12:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:50,760 INFO L87 Difference]: Start difference. First operand 728 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:51,259 INFO L93 Difference]: Finished difference Result 1344 states and 1944 transitions. [2024-11-10 01:12:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:12:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:12:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:51,262 INFO L225 Difference]: With dead ends: 1344 [2024-11-10 01:12:51,262 INFO L226 Difference]: Without dead ends: 735 [2024-11-10 01:12:51,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:12:51,263 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 5 mSDsluCounter, 4336 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5064 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:51,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5064 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:12:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-10 01:12:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2024-11-10 01:12:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4463040446304045) internal successors, (1037), 717 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2024-11-10 01:12:51,273 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 73 [2024-11-10 01:12:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:51,273 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2024-11-10 01:12:51,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2024-11-10 01:12:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:12:51,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:51,274 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:12:51,274 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1369484893, now seen corresponding path program 1 times [2024-11-10 01:12:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979101182] [2024-11-10 01:12:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:12:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979101182] [2024-11-10 01:12:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979101182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824904195] [2024-11-10 01:12:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:12:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:51,404 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:51,642 INFO L93 Difference]: Finished difference Result 1329 states and 1928 transitions. [2024-11-10 01:12:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:12:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:51,645 INFO L225 Difference]: With dead ends: 1329 [2024-11-10 01:12:51,645 INFO L226 Difference]: Without dead ends: 718 [2024-11-10 01:12:51,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:51,646 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 872 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:51,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1409 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:12:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-10 01:12:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-10 01:12:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4435146443514644) internal successors, (1035), 717 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1035 transitions. [2024-11-10 01:12:51,656 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1035 transitions. Word has length 73 [2024-11-10 01:12:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1035 transitions. [2024-11-10 01:12:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1035 transitions. [2024-11-10 01:12:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 01:12:51,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:51,657 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:51,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:12:51,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1820179005, now seen corresponding path program 1 times [2024-11-10 01:12:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:12:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270495100] [2024-11-10 01:12:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:12:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:12:51,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:12:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:12:51,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:12:51,770 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:12:51,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:12:51,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:12:51,777 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:51,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:12:51,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:12:51 BoogieIcfgContainer [2024-11-10 01:12:51,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:12:51,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:12:51,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:12:51,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:12:51,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:36" (3/4) ... [2024-11-10 01:12:51,849 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:12:51,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:12:51,851 INFO L158 Benchmark]: Toolchain (without parser) took 18249.61ms. Allocated memory was 146.8MB in the beginning and 578.8MB in the end (delta: 432.0MB). Free memory was 75.7MB in the beginning and 416.5MB in the end (delta: -340.8MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,851 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:12:51,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.60ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.7MB in the beginning and 173.1MB in the end (delta: -97.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 190.61ms. Allocated memory is still 211.8MB. Free memory was 173.1MB in the beginning and 133.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,854 INFO L158 Benchmark]: Boogie Preprocessor took 193.58ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 114.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,854 INFO L158 Benchmark]: IcfgBuilder took 1902.69ms. Allocated memory was 211.8MB in the beginning and 331.4MB in the end (delta: 119.5MB). Free memory was 114.4MB in the beginning and 214.5MB in the end (delta: -100.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,854 INFO L158 Benchmark]: TraceAbstraction took 15458.04ms. Allocated memory was 331.4MB in the beginning and 578.8MB in the end (delta: 247.5MB). Free memory was 213.4MB in the beginning and 416.5MB in the end (delta: -203.0MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-10 01:12:51,854 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 578.8MB. Free memory is still 416.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:12:51,855 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.60ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.7MB in the beginning and 173.1MB in the end (delta: -97.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 190.61ms. Allocated memory is still 211.8MB. Free memory was 173.1MB in the beginning and 133.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 193.58ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 114.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1902.69ms. Allocated memory was 211.8MB in the beginning and 331.4MB in the end (delta: 119.5MB). Free memory was 114.4MB in the beginning and 214.5MB in the end (delta: -100.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15458.04ms. Allocated memory was 331.4MB in the beginning and 578.8MB in the end (delta: 247.5MB). Free memory was 213.4MB in the beginning and 416.5MB in the end (delta: -203.0MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 578.8MB. Free memory is still 416.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 849; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 500; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=500] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=500] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=500] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=500] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=-2, var_33_arg_1=16, var_79=500] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=500] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=500] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=500] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_34=1, var_79=500] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=500] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_79=500] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_79=500] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 600 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13383 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13383 mSDsluCounter, 69003 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53164 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16997 IncrementalHoareTripleChecker+Invalid, 17037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 15839 mSDtfsCounter, 16997 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=20, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1060 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1550 NumberOfCodeBlocks, 1550 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 5295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 01:12:51,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:12:53,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:12:54,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 01:12:54,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:12:54,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:12:54,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:12:54,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:12:54,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:12:54,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:12:54,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:12:54,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:12:54,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:12:54,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:12:54,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:12:54,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:12:54,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:12:54,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:12:54,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:12:54,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:12:54,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:12:54,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:12:54,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 01:12:54,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 01:12:54,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:12:54,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 01:12:54,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:12:54,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:12:54,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:12:54,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:12:54,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:12:54,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:12:54,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:54,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:12:54,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:12:54,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:12:54,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 01:12:54,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 01:12:54,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:12:54,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:12:54,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:12:54,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:12:54,084 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd [2024-11-10 01:12:54,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:12:54,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:12:54,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:12:54,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:12:54,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:12:54,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:55,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:12:56,059 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:12:56,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:56,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba306a58/25ee4819c40b4c5484a721002fcff495/FLAG264d10efa [2024-11-10 01:12:56,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba306a58/25ee4819c40b4c5484a721002fcff495 [2024-11-10 01:12:56,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:12:56,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:12:56,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:56,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:12:56,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:12:56,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621654a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56, skipping insertion in model container [2024-11-10 01:12:56,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:12:56,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:56,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:12:56,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:56,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:56,572 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:12:56,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56 WrapperNode [2024-11-10 01:12:56,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:56,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:56,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:12:56,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:12:56,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,623 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2024-11-10 01:12:56,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:56,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:12:56,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:12:56,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:12:56,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,663 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-11-10 01:12:56,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:12:56,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:12:56,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:12:56,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:12:56,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:12:56,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:12:56,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:12:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:12:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 01:12:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:12:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:12:56,907 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:12:56,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:12:57,346 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-10 01:12:57,346 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:12:57,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:12:57,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:12:57,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:57 BoogieIcfgContainer [2024-11-10 01:12:57,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:12:57,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:12:57,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:12:57,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:12:57,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:12:56" (1/3) ... [2024-11-10 01:12:57,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de3d487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:57, skipping insertion in model container [2024-11-10 01:12:57,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (2/3) ... [2024-11-10 01:12:57,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de3d487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:57, skipping insertion in model container [2024-11-10 01:12:57,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:57" (3/3) ... [2024-11-10 01:12:57,369 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-11-10 01:12:57,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:12:57,386 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:12:57,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:12:57,441 INFO L333 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=LoopHeads, 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;@5e2044d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:12:57,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:12:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 01:12:57,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:57,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 01:12:57,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 01:12:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:12:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767450133] [2024-11-10 01:12:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:12:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:12:57,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:12:57,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 01:12:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:57,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 01:12:57,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:12:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:12:58,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:12:58,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:12:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767450133] [2024-11-10 01:12:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767450133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:12:58,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:12:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:12:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572208478] [2024-11-10 01:12:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:12:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:12:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:12:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:12:58,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:58,059 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:12:58,130 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 01:12:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:12:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 01:12:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:12:58,138 INFO L225 Difference]: With dead ends: 21 [2024-11-10 01:12:58,139 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 01:12:58,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:12:58,146 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:12:58,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:12:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 01:12:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 01:12:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 01:12:58,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 01:12:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:12:58,173 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 01:12:58,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:12:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 01:12:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 01:12:58,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:12:58,175 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:12:58,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 01:12:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:12:58,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:12:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:12:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 01:12:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:12:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161335557] [2024-11-10 01:12:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:12:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:12:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:12:58,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:12:58,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 01:12:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:12:58,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 01:12:58,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:13:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:01,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:13:07,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse18 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse114 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse116 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse113 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse18)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv254 32))))) (.cse25 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse204 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse205 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse204) (= (_ bv0 8) .cse205) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse220 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse212 ((_ zero_extend 24) .cse205)) (.cse216 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse218 ((_ zero_extend 24) .cse204))) (let ((.cse217 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse218))))))) (.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse216))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse214 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse212))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse220)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse207 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse210 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse207))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse208 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 .cse211))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse210 .cse211)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse208 .cse25))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))) (let ((.cse221 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (let ((.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse220 .cse221))))) (let ((.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse216 .cse217))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse218 .cse219)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse220 .cse221)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse214)))))) .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse211 .cse72)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse217))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse72))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse225))))))) (.cse229 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse25))) .cse222)))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse228 .cse229)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse232 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse211)))))))) (let ((.cse230 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse233)))) (.cse231 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse217 .cse18))) .cse223))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse233)))))))))))))))))))))))))))))))))))) .cse7))))))))))))))))))) (.cse5 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse203 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse191 ((_ zero_extend 24) .cse203)) (.cse202 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse200))))))) (.cse188 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse202))))))) (.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse191))))))) (.cse189 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse186 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse180 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse191 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse193))))))) (.cse181 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse25))) .cse190)))) (.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse181)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse188))))))) (.cse185 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse18))))))) (.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse184 .cse185))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse184 .cse185))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse194 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse197 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse194))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse194))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse195 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse196 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse197 .cse188))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse196 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse197 .cse188)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse195 .cse25))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse201 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse186)))))))) (let ((.cse199 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse201))))) (let ((.cse198 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse199))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse189)))))) .cse194))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse23))) .cse193))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse188 .cse23))) .cse187))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse186)))))))))))) .cse51))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse25)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse191)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse198 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse189 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse201))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse186))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse203))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse177 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse177 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse177) (_ bv0 32))))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse176 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse169 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse171 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse164 ((_ zero_extend 24) .cse176))) (let ((.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse171))))))) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse169))))))) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse159 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166))))))) (.cse154 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse151 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse25))) .cse163)))) (.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse154))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse154)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse157 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))))))) (.cse158 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse159 .cse18))))))) (.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse157 .cse158))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse157 .cse158))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse173 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse172 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse171 .cse159)))))))) (let ((.cse168 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse169 .cse170))))) (let ((.cse167 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse168))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse167 .cse164))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse162 .cse168))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse169 .cse170))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse171 .cse159))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse164))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse163 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162)))))) .cse172))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse161 .cse72)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse173 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse159))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse72)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse174 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse165 .cse172))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse172))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse174 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse175 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse173 .cse161))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse175 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse173 .cse161)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse25))))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse176))))) (.cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse4 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse150 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse114 (bvashr (bvor .cse150 .cse116) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse150) (_ bv0 32)))))) (.cse6 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse148 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse149 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse128 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse120 ((_ zero_extend 24) .cse149)) (.cse124 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse126 ((_ zero_extend 24) .cse148))) (let ((.cse125 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse126))))))) (.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse124))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse122 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse120))))))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse128)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse135 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse130 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse127 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse124 .cse125))))) (let ((.cse129 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 .cse127))))) (let ((.cse123 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse128 .cse129))))) (let ((.cse121 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse123))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse120 .cse121))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse122 .cse123))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse124 .cse125))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse126 .cse127)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse128 .cse129)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 .cse121))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse122)))))) .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse23))) .cse132))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse133 .cse23))) .cse134))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse125)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse136)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse137 .cse25)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse138 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse131 .cse130))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse138 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse139 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse135 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse25))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse132))))))) (.cse143 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse140 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse25))) .cse137)))) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse142 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse133)))))))) (let ((.cse144 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 .cse147)))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse125 .cse18))) .cse136))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse146 .cse147)))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))) .cse7))))))))) (= (_ bv0 8) .cse148) (= (_ bv0 8) .cse149)))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4) (or .cse3 .cse2) (or .cse4 .cse5 .cse0) (or .cse6 .cse2) (or .cse5 .cse0 .cse2) (or .cse4 .cse0 .cse1) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse39 (let ((.cse118 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse113 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse113)))))))))) .cse113))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor .cse118 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse117) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse117)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse119 (bvor .cse118 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse119)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse114 (bvashr (bvor .cse116 .cse119) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse38 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse112 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse112))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse112) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse115 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse114 (bvashr (bvor .cse115 .cse116) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse115))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse25))))) (and (or (forall ((|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse8 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse8) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse20 ((_ zero_extend 24) .cse8)) (.cse34 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse36 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse36))))))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse34))))))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse20))))))) (.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse27))))))) (.cse10 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse24 .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse12)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse15 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse22)))))))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16)))) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse18))) .cse19))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse13 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse16)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 .cse12)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse31 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse28))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 .cse22))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 .cse22)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse29 .cse25))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse17))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 .cse35))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse37))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse24 .cse32)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse24)))))) .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse23))) .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse17)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse19)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse32))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse35)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37))))))))))))))))))))))))))))))))))))))))))))))))))) .cse7)) (_ bv0 8))))) .cse38) (or .cse39 .cse0 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse54))))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse52)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 .cse41))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse44 .cse45))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse43 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse45)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse43 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse25))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse50)))))))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse52 .cse53))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse47))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse46)))))) .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse23))) .cse48))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse23))) .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse50)))))))))))) .cse51))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse47))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse53))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 .cse50))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse48))))))) (.cse58 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse58)))) (.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse56)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse45))))))) (.cse62 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse18))))))) (.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse61 .cse62))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 .cse60))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse60))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse62)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)))) (or .cse39 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse75 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse73 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse77))))))) (.cse68 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse75)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse64 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse67 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse63 .cse64))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse64))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse68))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse68)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 .cse25))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse73)))))))) (let ((.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse75 .cse76))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse69 .cse70))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse69)))))) .cse64))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse72)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse73))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse72)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse70))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse76))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 .cse73))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse74))))))) (.cse81 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse81)))) (.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse69 .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse78 .cse79))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse81))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse78 .cse79)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse84 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse71 .cse68))))))) (.cse85 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse73 .cse18))))))) (.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse84 .cse85))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse82 .cse83))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse83))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse84 .cse85)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8))) .cse0) (or .cse38 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse86 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse86) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse104 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse97 ((_ zero_extend 24) .cse86))) (let ((.cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse97))))))) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse104))))))) (.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse95 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse102))))))) (.cse88 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88)))) (.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse90)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse93 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse94 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse99)))))))) (let ((.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse93 .cse94)))) (.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse95 .cse18))) .cse96))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse93 .cse94)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse89 .cse90)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse95))))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 .cse105))))) (let ((.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse107))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse105)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse107)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100)))))) .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse96))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse72)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse95))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse72)))))))))))) .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse103))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse101 .cse108))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse25))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 .cse99))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse111 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse109 .cse99)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 .cse18)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse25))))))))))))))))))))))))))))))) (_ bv1 32)))))))))))))) (or .cse4 .cse6)))))) is different from false [2024-11-10 01:13:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-10 01:13:08,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:13:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161335557] [2024-11-10 01:13:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161335557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:13:08,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 01:13:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 01:13:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812821721] [2024-11-10 01:13:08,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 01:13:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:13:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:13:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:13:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-11-10 01:13:08,341 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:13,819 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-10 01:13:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:13:13,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-11-10 01:13:13,821 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:13,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:13:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-10 01:13:13,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 01:13:14,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:13:14,023 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 48 more [2024-11-10 01:13:14,027 INFO L158 Benchmark]: Toolchain (without parser) took 17926.33ms. Allocated memory was 104.9MB in the beginning and 398.5MB in the end (delta: 293.6MB). Free memory was 77.2MB in the beginning and 240.5MB in the end (delta: -163.3MB). Peak memory consumption was 239.0MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,027 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 96.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.70ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 78.6MB in the end (delta: -1.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.72ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 74.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,032 INFO L158 Benchmark]: Boogie Preprocessor took 61.82ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 69.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,032 INFO L158 Benchmark]: IcfgBuilder took 673.94ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 47.1MB in the end (delta: 22.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,032 INFO L158 Benchmark]: TraceAbstraction took 16664.39ms. Allocated memory was 104.9MB in the beginning and 398.5MB in the end (delta: 293.6MB). Free memory was 46.5MB in the beginning and 240.5MB in the end (delta: -194.0MB). Peak memory consumption was 209.9MB. Max. memory is 16.1GB. [2024-11-10 01:13:14,037 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 96.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.70ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 78.6MB in the end (delta: -1.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.72ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 74.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.82ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 69.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 673.94ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 47.1MB in the end (delta: 22.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16664.39ms. Allocated memory was 104.9MB in the beginning and 398.5MB in the end (delta: 293.6MB). Free memory was 46.5MB in the beginning and 240.5MB in the end (delta: -194.0MB). Peak memory consumption was 209.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")