./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.vis_arrays_am2910_p4.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 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:57:09,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:57:09,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:57:09,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:57:09,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:57:09,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:57:09,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:57:09,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:57:09,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:57:09,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:57:09,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:57:09,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:57:09,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:57:09,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:57:09,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:57:09,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:57:09,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:57:09,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:57:09,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:57:09,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:57:09,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:57:09,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:57:09,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:57:09,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:57:09,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:57:09,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:57:09,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:57:09,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:57:09,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:57:09,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:57:09,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:57:09,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:57:09,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:57:09,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:57:09,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:57:09,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:57:09,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:57:09,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:57:09,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:57:09,749 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 -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2024-11-16 11:57:10,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:57:10,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:57:10,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:57:10,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:57:10,027 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:57:10,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:11,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:57:11,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:57:11,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:11,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5c2edd2/39ce337a71d84bae906c73b9301e481c/FLAG378489ae0 [2024-11-16 11:57:11,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5c2edd2/39ce337a71d84bae906c73b9301e481c [2024-11-16 11:57:11,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:57:11,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:57:11,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:57:11,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:57:11,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:57:11,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:11" (1/1) ... [2024-11-16 11:57:11,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcbfab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:11, skipping insertion in model container [2024-11-16 11:57:11,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:11" (1/1) ... [2024-11-16 11:57:11,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:57:11,836 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.vis_arrays_am2910_p4.c[1260,1273] [2024-11-16 11:57:12,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:57:12,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:57:12,130 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.vis_arrays_am2910_p4.c[1260,1273] [2024-11-16 11:57:12,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:57:12,327 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:57:12,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12 WrapperNode [2024-11-16 11:57:12,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:57:12,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:57:12,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:57:12,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:57:12,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:12,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:12,777 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4899 [2024-11-16 11:57:12,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:57:12,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:57:12,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:57:12,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:57:12,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:12,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:12,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,056 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-16 11:57:13,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:57:13,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:57:13,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:57:13,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:57:13,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (1/1) ... [2024-11-16 11:57:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:57:13,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:57:13,343 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-16 11:57:13,345 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-16 11:57:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:57:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:57:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:57:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:57:13,672 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:57:13,676 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:57:17,733 INFO L? ?]: Removed 2880 outVars from TransFormulas that were not future-live. [2024-11-16 11:57:17,734 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:57:17,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:57:17,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:57:17,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:17 BoogieIcfgContainer [2024-11-16 11:57:17,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:57:17,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:57:17,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:57:17,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:57:17,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:11" (1/3) ... [2024-11-16 11:57:17,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a57ce63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:17, skipping insertion in model container [2024-11-16 11:57:17,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:12" (2/3) ... [2024-11-16 11:57:17,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a57ce63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:17, skipping insertion in model container [2024-11-16 11:57:17,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:17" (3/3) ... [2024-11-16 11:57:17,903 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:17,919 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:57:17,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:57:18,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:57:18,010 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;@11d56ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:57:18,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:57:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 1537 states, 1535 states have (on average 1.498371335504886) internal successors, (2300), 1536 states have internal predecessors, (2300), 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-16 11:57:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 11:57:18,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:18,026 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] [2024-11-16 11:57:18,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:18,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash -220798213, now seen corresponding path program 1 times [2024-11-16 11:57:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47001511] [2024-11-16 11:57:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:18,732 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-16 11:57:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47001511] [2024-11-16 11:57:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47001511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:18,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:18,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:57:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327900925] [2024-11-16 11:57:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:18,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:57:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:57:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:57:18,764 INFO L87 Difference]: Start difference. First operand has 1537 states, 1535 states have (on average 1.498371335504886) internal successors, (2300), 1536 states have internal predecessors, (2300), 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 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-16 11:57:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:19,520 INFO L93 Difference]: Finished difference Result 3021 states and 4525 transitions. [2024-11-16 11:57:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:57:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-11-16 11:57:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:19,536 INFO L225 Difference]: With dead ends: 3021 [2024-11-16 11:57:19,536 INFO L226 Difference]: Without dead ends: 1534 [2024-11-16 11:57:19,541 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-16 11:57:19,543 INFO L432 NwaCegarLoop]: 1911 mSDtfsCounter, 0 mSDsluCounter, 3817 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5728 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:19,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5728 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 11:57:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-16 11:57:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1534. [2024-11-16 11:57:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.4977168949771689) internal successors, (2296), 1533 states have internal predecessors, (2296), 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-16 11:57:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2296 transitions. [2024-11-16 11:57:19,621 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2296 transitions. Word has length 48 [2024-11-16 11:57:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2296 transitions. [2024-11-16 11:57:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-16 11:57:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2296 transitions. [2024-11-16 11:57:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 11:57:19,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:19,623 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] [2024-11-16 11:57:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:57:19,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:19,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1890245886, now seen corresponding path program 1 times [2024-11-16 11:57:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335070112] [2024-11-16 11:57:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:19,796 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-16 11:57:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:19,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335070112] [2024-11-16 11:57:19,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335070112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:19,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:19,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:57:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713746249] [2024-11-16 11:57:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:57:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:57:19,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:57:19,799 INFO L87 Difference]: Start difference. First operand 1534 states and 2296 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-16 11:57:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:20,384 INFO L93 Difference]: Finished difference Result 3020 states and 4521 transitions. [2024-11-16 11:57:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:57:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-11-16 11:57:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:20,388 INFO L225 Difference]: With dead ends: 3020 [2024-11-16 11:57:20,389 INFO L226 Difference]: Without dead ends: 1536 [2024-11-16 11:57:20,391 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-16 11:57:20,392 INFO L432 NwaCegarLoop]: 1911 mSDtfsCounter, 0 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5725 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-16 11:57:20,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5725 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 11:57:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-16 11:57:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2024-11-16 11:57:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 1.4970684039087947) internal successors, (2298), 1535 states have internal predecessors, (2298), 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-16 11:57:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2298 transitions. [2024-11-16 11:57:20,414 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2298 transitions. Word has length 49 [2024-11-16 11:57:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:20,414 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2298 transitions. [2024-11-16 11:57:20,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-16 11:57:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2298 transitions. [2024-11-16 11:57:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 11:57:20,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:20,416 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] [2024-11-16 11:57:20,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:57:20,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1784673600, now seen corresponding path program 1 times [2024-11-16 11:57:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410378044] [2024-11-16 11:57:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:21,151 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-16 11:57:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410378044] [2024-11-16 11:57:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410378044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:57:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246993144] [2024-11-16 11:57:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:21,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:57:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:57:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:57:21,154 INFO L87 Difference]: Start difference. First operand 1536 states and 2298 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-16 11:57:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:22,385 INFO L93 Difference]: Finished difference Result 3050 states and 4564 transitions. [2024-11-16 11:57:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 11:57:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2024-11-16 11:57:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:22,391 INFO L225 Difference]: With dead ends: 3050 [2024-11-16 11:57:22,391 INFO L226 Difference]: Without dead ends: 1564 [2024-11-16 11:57:22,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-16 11:57:22,394 INFO L432 NwaCegarLoop]: 1901 mSDtfsCounter, 2331 mSDsluCounter, 9499 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 11400 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:22,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 11400 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 11:57:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-16 11:57:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1560. [2024-11-16 11:57:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1559 states have (on average 1.495830660679923) internal successors, (2332), 1559 states have internal predecessors, (2332), 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-16 11:57:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2332 transitions. [2024-11-16 11:57:22,421 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2332 transitions. Word has length 50 [2024-11-16 11:57:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:22,421 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2332 transitions. [2024-11-16 11:57:22,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-16 11:57:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2332 transitions. [2024-11-16 11:57:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 11:57:22,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:22,423 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] [2024-11-16 11:57:22,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:57:22,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:22,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1080608839, now seen corresponding path program 1 times [2024-11-16 11:57:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:22,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071876181] [2024-11-16 11:57:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:22,930 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-16 11:57:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071876181] [2024-11-16 11:57:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071876181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 11:57:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523465915] [2024-11-16 11:57:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 11:57:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 11:57:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:57:22,932 INFO L87 Difference]: Start difference. First operand 1560 states and 2332 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-16 11:57:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:24,441 INFO L93 Difference]: Finished difference Result 3057 states and 4572 transitions. [2024-11-16 11:57:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:57:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 51 [2024-11-16 11:57:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:24,450 INFO L225 Difference]: With dead ends: 3057 [2024-11-16 11:57:24,450 INFO L226 Difference]: Without dead ends: 1571 [2024-11-16 11:57:24,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:57:24,453 INFO L432 NwaCegarLoop]: 1893 mSDtfsCounter, 2338 mSDsluCounter, 13241 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 15134 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:24,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 15134 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 11:57:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-16 11:57:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1568. [2024-11-16 11:57:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4952137843012125) internal successors, (2343), 1567 states have internal predecessors, (2343), 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-16 11:57:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2343 transitions. [2024-11-16 11:57:24,477 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2343 transitions. Word has length 51 [2024-11-16 11:57:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:24,477 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2343 transitions. [2024-11-16 11:57:24,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-16 11:57:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2343 transitions. [2024-11-16 11:57:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 11:57:24,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:24,479 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] [2024-11-16 11:57:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:57:24,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:24,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 690360800, now seen corresponding path program 1 times [2024-11-16 11:57:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996461662] [2024-11-16 11:57:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:24,855 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-16 11:57:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996461662] [2024-11-16 11:57:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996461662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:57:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728742996] [2024-11-16 11:57:24,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:24,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:57:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:24,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:57:24,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:57:24,857 INFO L87 Difference]: Start difference. First operand 1568 states and 2343 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-16 11:57:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:25,819 INFO L93 Difference]: Finished difference Result 3072 states and 4591 transitions. [2024-11-16 11:57:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:57:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2024-11-16 11:57:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:25,824 INFO L225 Difference]: With dead ends: 3072 [2024-11-16 11:57:25,825 INFO L226 Difference]: Without dead ends: 1569 [2024-11-16 11:57:25,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 11:57:25,828 INFO L432 NwaCegarLoop]: 1901 mSDtfsCounter, 2306 mSDsluCounter, 7595 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2306 SdHoareTripleChecker+Valid, 9496 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:25,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2306 Valid, 9496 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 11:57:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-16 11:57:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-16 11:57:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.4942602040816326) internal successors, (2343), 1568 states have internal predecessors, (2343), 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-16 11:57:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2343 transitions. [2024-11-16 11:57:25,854 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2343 transitions. Word has length 52 [2024-11-16 11:57:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:25,854 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2343 transitions. [2024-11-16 11:57:25,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-16 11:57:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2343 transitions. [2024-11-16 11:57:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 11:57:25,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:25,856 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] [2024-11-16 11:57:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:57:25,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash -421024438, now seen corresponding path program 1 times [2024-11-16 11:57:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121419144] [2024-11-16 11:57:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:26,476 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-16 11:57:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:26,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121419144] [2024-11-16 11:57:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121419144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:26,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:57:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539816956] [2024-11-16 11:57:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:57:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:57:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:57:26,482 INFO L87 Difference]: Start difference. First operand 1569 states and 2343 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-16 11:57:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:27,252 INFO L93 Difference]: Finished difference Result 3076 states and 4594 transitions. [2024-11-16 11:57:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:57:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2024-11-16 11:57:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:27,257 INFO L225 Difference]: With dead ends: 3076 [2024-11-16 11:57:27,257 INFO L226 Difference]: Without dead ends: 1569 [2024-11-16 11:57:27,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:57:27,259 INFO L432 NwaCegarLoop]: 1901 mSDtfsCounter, 2296 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:27,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 5698 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 11:57:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-16 11:57:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-16 11:57:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.4936224489795917) internal successors, (2342), 1568 states have internal predecessors, (2342), 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-16 11:57:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2342 transitions. [2024-11-16 11:57:27,287 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2342 transitions. Word has length 52 [2024-11-16 11:57:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2342 transitions. [2024-11-16 11:57:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-16 11:57:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2342 transitions. [2024-11-16 11:57:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 11:57:27,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:27,291 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] [2024-11-16 11:57:27,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:57:27,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash -406715537, now seen corresponding path program 1 times [2024-11-16 11:57:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:27,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721798168] [2024-11-16 11:57:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:27,905 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-16 11:57:27,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:27,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721798168] [2024-11-16 11:57:27,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721798168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:27,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 11:57:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219111411] [2024-11-16 11:57:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:27,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:57:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:57:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:57:27,907 INFO L87 Difference]: Start difference. First operand 1569 states and 2342 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-16 11:57:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:29,097 INFO L93 Difference]: Finished difference Result 3073 states and 4589 transitions. [2024-11-16 11:57:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:57:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 53 [2024-11-16 11:57:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:29,102 INFO L225 Difference]: With dead ends: 3073 [2024-11-16 11:57:29,102 INFO L226 Difference]: Without dead ends: 1572 [2024-11-16 11:57:29,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-16 11:57:29,105 INFO L432 NwaCegarLoop]: 1902 mSDtfsCounter, 2301 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 11400 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:29,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2301 Valid, 11400 Invalid, 2364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 11:57:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-16 11:57:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1571. [2024-11-16 11:57:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.4929936305732483) internal successors, (2344), 1570 states have internal predecessors, (2344), 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-16 11:57:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2344 transitions. [2024-11-16 11:57:29,127 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2344 transitions. Word has length 53 [2024-11-16 11:57:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:29,128 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2344 transitions. [2024-11-16 11:57:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-16 11:57:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2344 transitions. [2024-11-16 11:57:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 11:57:29,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:29,129 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] [2024-11-16 11:57:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 11:57:29,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1689733882, now seen corresponding path program 1 times [2024-11-16 11:57:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143236304] [2024-11-16 11:57:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:29,387 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-16 11:57:29,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143236304] [2024-11-16 11:57:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143236304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:29,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:29,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:57:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631351646] [2024-11-16 11:57:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:57:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:57:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:57:29,388 INFO L87 Difference]: Start difference. First operand 1571 states and 2344 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 11:57:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:30,054 INFO L93 Difference]: Finished difference Result 3074 states and 4590 transitions. [2024-11-16 11:57:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:57:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2024-11-16 11:57:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:30,063 INFO L225 Difference]: With dead ends: 3074 [2024-11-16 11:57:30,063 INFO L226 Difference]: Without dead ends: 1566 [2024-11-16 11:57:30,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:57:30,065 INFO L432 NwaCegarLoop]: 1906 mSDtfsCounter, 2296 mSDsluCounter, 3809 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 5715 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:30,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 5715 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:57:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-16 11:57:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-16 11:57:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.4932907348242812) internal successors, (2337), 1565 states have internal predecessors, (2337), 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-16 11:57:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2337 transitions. [2024-11-16 11:57:30,087 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2337 transitions. Word has length 54 [2024-11-16 11:57:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2337 transitions. [2024-11-16 11:57:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 11:57:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2337 transitions. [2024-11-16 11:57:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 11:57:30,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:30,088 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] [2024-11-16 11:57:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 11:57:30,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1890243013, now seen corresponding path program 1 times [2024-11-16 11:57:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:30,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906313671] [2024-11-16 11:57:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:30,300 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-16 11:57:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:57:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906313671] [2024-11-16 11:57:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906313671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:57:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986586413] [2024-11-16 11:57:30,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:57:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:57:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:57:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:57:30,303 INFO L87 Difference]: Start difference. First operand 1566 states and 2337 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-16 11:57:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:30,995 INFO L93 Difference]: Finished difference Result 3059 states and 4570 transitions. [2024-11-16 11:57:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:57:30,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2024-11-16 11:57:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:30,999 INFO L225 Difference]: With dead ends: 3059 [2024-11-16 11:57:30,999 INFO L226 Difference]: Without dead ends: 1573 [2024-11-16 11:57:31,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:57:31,003 INFO L432 NwaCegarLoop]: 1903 mSDtfsCounter, 2253 mSDsluCounter, 5698 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 7601 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:31,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 7601 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:57:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-16 11:57:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1566. [2024-11-16 11:57:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.4932907348242812) internal successors, (2337), 1565 states have internal predecessors, (2337), 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-16 11:57:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2337 transitions. [2024-11-16 11:57:31,028 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2337 transitions. Word has length 54 [2024-11-16 11:57:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:31,029 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2337 transitions. [2024-11-16 11:57:31,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-16 11:57:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2337 transitions. [2024-11-16 11:57:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 11:57:31,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:31,030 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] [2024-11-16 11:57:31,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 11:57:31,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:31,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash 778857775, now seen corresponding path program 1 times [2024-11-16 11:57:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:57:31,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154256167] [2024-11-16 11:57:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:57:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:57:31,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:57:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:57:31,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:57:31,217 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:57:31,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:57:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 11:57:31,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:57:31,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:57:31,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:57:31 BoogieIcfgContainer [2024-11-16 11:57:31,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:57:31,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:57:31,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:57:31,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:57:31,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:17" (3/4) ... [2024-11-16 11:57:31,296 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:57:31,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:57:31,298 INFO L158 Benchmark]: Toolchain (without parser) took 19669.59ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 178.5MB. Max. memory is 16.1GB. [2024-11-16 11:57:31,300 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:57:31,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.33ms. Allocated memory was 163.6MB in the beginning and 247.5MB in the end (delta: 83.9MB). Free memory was 123.0MB in the beginning and 184.3MB in the end (delta: -61.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-11-16 11:57:31,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 448.98ms. Allocated memory is still 247.5MB. Free memory was 184.3MB in the beginning and 110.1MB in the end (delta: 74.2MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-11-16 11:57:31,301 INFO L158 Benchmark]: Boogie Preprocessor took 535.41ms. Allocated memory is still 247.5MB. Free memory was 110.1MB in the beginning and 99.1MB in the end (delta: 11.0MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-16 11:57:31,301 INFO L158 Benchmark]: IcfgBuilder took 4581.22ms. Allocated memory was 247.5MB in the beginning and 757.1MB in the end (delta: 509.6MB). Free memory was 99.1MB in the beginning and 268.4MB in the end (delta: -169.3MB). Peak memory consumption was 342.9MB. Max. memory is 16.1GB. [2024-11-16 11:57:31,301 INFO L158 Benchmark]: TraceAbstraction took 13395.79ms. Allocated memory was 757.1MB in the beginning and 1.4GB in the end (delta: 599.8MB). Free memory was 267.4MB in the beginning and 1.1GB in the end (delta: -873.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:57:31,301 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:57:31,302 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.19ms. Allocated memory is still 163.6MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.33ms. Allocated memory was 163.6MB in the beginning and 247.5MB in the end (delta: 83.9MB). Free memory was 123.0MB in the beginning and 184.3MB in the end (delta: -61.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 448.98ms. Allocated memory is still 247.5MB. Free memory was 184.3MB in the beginning and 110.1MB in the end (delta: 74.2MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 535.41ms. Allocated memory is still 247.5MB. Free memory was 110.1MB in the beginning and 99.1MB in the end (delta: 11.0MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * IcfgBuilder took 4581.22ms. Allocated memory was 247.5MB in the beginning and 757.1MB in the end (delta: 509.6MB). Free memory was 99.1MB in the beginning and 268.4MB in the end (delta: -169.3MB). Peak memory consumption was 342.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13395.79ms. Allocated memory was 757.1MB in the beginning and 1.4GB in the end (delta: 599.8MB). Free memory was 267.4MB in the beginning and 1.1GB in the end (delta: -873.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. 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 bitwiseAnd at line 228. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 3); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (3 - 1); [L38] const SORT_310 mask_SORT_310 = (SORT_310)-1 >> (sizeof(SORT_310) * 8 - 2); [L39] const SORT_310 msb_SORT_310 = (SORT_310)1 << (2 - 1); [L41] const SORT_314 mask_SORT_314 = (SORT_314)-1 >> (sizeof(SORT_314) * 8 - 5); [L42] const SORT_314 msb_SORT_314 = (SORT_314)1 << (5 - 1); [L44] const SORT_316 mask_SORT_316 = (SORT_316)-1 >> (sizeof(SORT_316) * 8 - 6); [L45] const SORT_316 msb_SORT_316 = (SORT_316)1 << (6 - 1); [L47] const SORT_318 mask_SORT_318 = (SORT_318)-1 >> (sizeof(SORT_318) * 8 - 7); [L48] const SORT_318 msb_SORT_318 = (SORT_318)1 << (7 - 1); [L50] const SORT_320 mask_SORT_320 = (SORT_320)-1 >> (sizeof(SORT_320) * 8 - 8); [L51] const SORT_320 msb_SORT_320 = (SORT_320)1 << (8 - 1); [L53] const SORT_322 mask_SORT_322 = (SORT_322)-1 >> (sizeof(SORT_322) * 8 - 9); [L54] const SORT_322 msb_SORT_322 = (SORT_322)1 << (9 - 1); [L56] const SORT_324 mask_SORT_324 = (SORT_324)-1 >> (sizeof(SORT_324) * 8 - 10); [L57] const SORT_324 msb_SORT_324 = (SORT_324)1 << (10 - 1); [L59] const SORT_326 mask_SORT_326 = (SORT_326)-1 >> (sizeof(SORT_326) * 8 - 11); [L60] const SORT_326 msb_SORT_326 = (SORT_326)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_22 var_23 = 0; [L64] const SORT_22 var_26 = 4; [L65] const SORT_22 var_29 = 5; [L66] const SORT_1 var_32 = 0; [L67] const SORT_1 var_35 = 2730; [L68] const SORT_8 var_42 = 1; [L69] const SORT_13 var_65 = 2; [L70] const SORT_13 var_70 = 9; [L71] const SORT_13 var_78 = 15; [L72] const SORT_13 var_83 = 1; [L73] const SORT_13 var_85 = 3; [L74] const SORT_13 var_88 = 5; [L75] const SORT_13 var_91 = 7; [L76] const SORT_13 var_94 = 11; [L77] const SORT_13 var_118 = 8; [L78] const SORT_13 var_122 = 10; [L79] const SORT_13 var_126 = 13; [L80] const SORT_13 var_137 = 4; [L81] const SORT_13 var_139 = 12; [L82] const SORT_13 var_142 = 14; [L83] const SORT_13 var_148 = 6; [L84] const SORT_13 var_175 = 0; [L85] const SORT_22 var_221 = 1; [L86] const SORT_1 var_250 = 4095; [L87] const SORT_1 var_580 = 1; [L88] const SORT_326 var_598 = 0; [L90] SORT_1 input_2; [L91] SORT_1 input_3; [L92] SORT_1 input_4; [L93] SORT_1 input_5; [L94] SORT_1 input_6; [L95] SORT_1 input_7; [L96] SORT_8 input_9; [L97] SORT_8 input_10; [L98] SORT_8 input_11; [L99] SORT_1 input_12; [L100] SORT_13 input_14; [L101] SORT_8 input_15; [L102] SORT_8 input_16; [L103] SORT_8 input_17; [L104] SORT_1 input_217; [L105] SORT_1 input_237; [L106] SORT_22 input_240; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L109] SORT_22 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L110] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L111] SORT_1 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L112] SORT_1 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L113] SORT_1 state_44 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L114] SORT_1 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L115] SORT_1 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L116] SORT_1 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L117] SORT_1 state_67 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L118] SORT_22 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L119] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L119] SORT_1 state_135 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L121] SORT_8 init_20_arg_1 = var_18; [L122] state_19 = init_20_arg_1 [L123] SORT_22 init_25_arg_1 = var_23; [L124] state_24 = init_25_arg_1 [L125] SORT_1 init_34_arg_1 = var_32; [L126] state_33 = init_34_arg_1 [L127] SORT_1 init_39_arg_1 = var_32; [L128] state_38 = init_39_arg_1 [L129] SORT_1 init_41_arg_1 = var_32; [L130] state_40 = init_41_arg_1 [L131] SORT_1 init_45_arg_1 = var_32; [L132] state_44 = init_45_arg_1 [L133] SORT_1 init_47_arg_1 = var_32; [L134] state_46 = init_47_arg_1 [L135] SORT_1 init_51_arg_1 = var_32; [L136] state_50 = init_51_arg_1 [L137] SORT_1 init_53_arg_1 = var_32; [L138] state_52 = init_53_arg_1 [L139] SORT_1 init_68_arg_1 = var_32; [L140] state_67 = init_68_arg_1 [L141] SORT_22 init_107_arg_1 = var_23; [L142] state_106 = init_107_arg_1 [L143] SORT_1 init_136_arg_1 = var_32; [L144] state_135 = init_136_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L147] input_2 = __VERIFIER_nondet_ushort() [L148] input_3 = __VERIFIER_nondet_ushort() [L149] input_4 = __VERIFIER_nondet_ushort() [L150] input_5 = __VERIFIER_nondet_ushort() [L151] input_6 = __VERIFIER_nondet_ushort() [L152] input_7 = __VERIFIER_nondet_ushort() [L153] input_9 = __VERIFIER_nondet_uchar() [L154] input_10 = __VERIFIER_nondet_uchar() [L155] input_11 = __VERIFIER_nondet_uchar() [L156] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L156] input_11 = input_11 & mask_SORT_8 [L157] input_12 = __VERIFIER_nondet_ushort() [L158] input_14 = __VERIFIER_nondet_uchar() [L159] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L159] input_14 = input_14 & mask_SORT_13 [L160] input_15 = __VERIFIER_nondet_uchar() [L161] input_16 = __VERIFIER_nondet_uchar() [L162] input_17 = __VERIFIER_nondet_uchar() [L163] input_217 = __VERIFIER_nondet_ushort() [L164] input_237 = __VERIFIER_nondet_ushort() [L165] input_240 = __VERIFIER_nondet_uchar() [L168] SORT_8 var_21_arg_0 = state_19; [L169] SORT_8 var_21_arg_1 = var_18; [L170] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L171] SORT_22 var_27_arg_0 = state_24; [L172] SORT_22 var_27_arg_1 = var_26; [L173] SORT_8 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_8 var_28_arg_0 = var_21; [L175] SORT_8 var_28_arg_1 = var_27; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_28_arg_0=1, var_28_arg_1=0, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] SORT_8 var_28 = var_28_arg_0 | var_28_arg_1; [L177] SORT_22 var_30_arg_0 = state_24; [L178] SORT_22 var_30_arg_1 = var_29; [L179] SORT_8 var_30 = var_30_arg_0 == var_30_arg_1; [L180] SORT_8 var_31_arg_0 = var_28; [L181] SORT_8 var_31_arg_1 = var_30; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_31_arg_0=1, var_31_arg_1=0, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] SORT_8 var_31 = var_31_arg_0 | var_31_arg_1; [L183] SORT_1 var_36_arg_0 = state_33; [L184] SORT_1 var_36_arg_1 = var_35; [L185] SORT_8 var_36 = var_36_arg_0 != var_36_arg_1; [L186] SORT_8 var_37_arg_0 = var_31; [L187] SORT_8 var_37_arg_1 = var_36; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37_arg_0=1, var_37_arg_1=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] SORT_8 var_37 = var_37_arg_0 | var_37_arg_1; [L189] SORT_8 var_55_arg_0 = var_42; [L190] SORT_1 var_55_arg_1 = input_7; [L191] SORT_1 var_55_arg_2 = input_6; [L192] SORT_1 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L193] SORT_8 var_54_arg_0 = var_42; [L194] SORT_1 var_54_arg_1 = state_52; [L195] SORT_1 var_54_arg_2 = state_50; [L196] SORT_1 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L197] SORT_8 var_56_arg_0 = var_18; [L198] SORT_1 var_56_arg_1 = var_55; [L199] SORT_1 var_56_arg_2 = var_54; [L200] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L201] SORT_8 var_48_arg_0 = var_42; [L202] SORT_1 var_48_arg_1 = state_46; [L203] SORT_1 var_48_arg_2 = state_44; [L204] SORT_1 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L205] SORT_8 var_43_arg_0 = var_42; [L206] SORT_1 var_43_arg_1 = state_40; [L207] SORT_1 var_43_arg_2 = state_38; [L208] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L209] SORT_8 var_49_arg_0 = var_18; [L210] SORT_1 var_49_arg_1 = var_48; [L211] SORT_1 var_49_arg_2 = var_43; [L212] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L213] SORT_8 var_57_arg_0 = var_42; [L214] SORT_1 var_57_arg_1 = var_56; [L215] SORT_1 var_57_arg_2 = var_49; [L216] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_57=0, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] EXPR var_57 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] var_57 = var_57 & mask_SORT_1 [L218] SORT_1 var_58_arg_0 = var_57; [L219] SORT_1 var_58_arg_1 = var_35; [L220] SORT_8 var_58 = var_58_arg_0 == var_58_arg_1; [L221] SORT_8 var_59_arg_0 = var_37; [L222] SORT_8 var_59_arg_1 = var_58; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_59_arg_0=1, var_59_arg_1=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] EXPR var_59_arg_0 | var_59_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] SORT_8 var_59 = var_59_arg_0 | var_59_arg_1; [L224] SORT_8 var_62_arg_0 = var_59; [L225] SORT_8 var_62 = ~var_62_arg_0; [L226] SORT_8 var_63_arg_0 = var_42; [L227] SORT_8 var_63_arg_1 = var_62; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] SORT_8 var_63 = var_63_arg_0 & var_63_arg_1; [L229] EXPR var_63 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L229] var_63 = var_63 & mask_SORT_8 [L230] SORT_8 bad_64_arg_0 = var_63; [L231] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1537 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16121 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16121 mSDsluCounter, 77897 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60768 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16168 IncrementalHoareTripleChecker+Invalid, 16174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 17129 mSDtfsCounter, 16168 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1571occurred in iteration=7, InterpolantAutomatonStates: 58, 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, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 2159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-16 11:57:31,332 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.vis_arrays_am2910_p4.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 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:57:33,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:57:33,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:57:33,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:57:33,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:57:33,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:57:33,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:57:33,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:57:33,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:57:33,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:57:33,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:57:33,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:57:33,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:57:33,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:57:33,460 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:57:33,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:57:33,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:57:33,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:57:33,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:57:33,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:57:33,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:57:33,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:57:33,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:57:33,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:57:33,466 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:57:33,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:57:33,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:57:33,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:57:33,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:57:33,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:57:33,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:57:33,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:57:33,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:57:33,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:57:33,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:57:33,469 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 -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2024-11-16 11:57:33,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:57:33,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:57:33,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:57:33,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:57:33,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:57:33,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:35,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:57:35,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:57:35,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:35,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e090fecda/0c0cbb23c2f8476da08a3c3be5fcd578/FLAGfac3b3ae1 [2024-11-16 11:57:35,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e090fecda/0c0cbb23c2f8476da08a3c3be5fcd578 [2024-11-16 11:57:35,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:57:35,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:57:35,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:57:35,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:57:35,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:57:35,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:35" (1/1) ... [2024-11-16 11:57:35,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfb2d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:35, skipping insertion in model container [2024-11-16 11:57:35,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:35" (1/1) ... [2024-11-16 11:57:35,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:57:35,968 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.vis_arrays_am2910_p4.c[1260,1273] [2024-11-16 11:57:36,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:57:36,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:57:36,255 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.vis_arrays_am2910_p4.c[1260,1273] [2024-11-16 11:57:36,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:57:36,374 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:57:36,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36 WrapperNode [2024-11-16 11:57:36,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:57:36,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:57:36,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:57:36,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:57:36,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,499 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1851 [2024-11-16 11:57:36,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:57:36,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:57:36,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:57:36,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:57:36,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,596 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-16 11:57:36,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:57:36,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:57:36,674 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:57:36,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:57:36,675 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (1/1) ... [2024-11-16 11:57:36,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:57:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:57:36,703 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-16 11:57:36,705 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-16 11:57:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:57:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:57:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:57:36,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:57:37,016 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:57:37,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:57:38,377 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-16 11:57:38,377 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:57:38,388 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:57:38,388 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:57:38,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:38 BoogieIcfgContainer [2024-11-16 11:57:38,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:57:38,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:57:38,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:57:38,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:57:38,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:35" (1/3) ... [2024-11-16 11:57:38,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763642e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:38, skipping insertion in model container [2024-11-16 11:57:38,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:36" (2/3) ... [2024-11-16 11:57:38,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763642e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:38, skipping insertion in model container [2024-11-16 11:57:38,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:38" (3/3) ... [2024-11-16 11:57:38,397 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2024-11-16 11:57:38,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:57:38,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:57:38,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:57:38,472 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;@6cdf2504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:57:38,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:57:38,477 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-16 11:57:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:57:38,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:38,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:57:38,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:38,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:57:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:57:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137330880] [2024-11-16 11:57:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:38,501 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-16 11:57:38,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:57:38,504 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-16 11:57:38,519 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-16 11:57:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:38,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 11:57:38,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:57:38,980 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-16 11:57:38,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:57:38,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:57:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137330880] [2024-11-16 11:57:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137330880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:57:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:57:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:57:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077033192] [2024-11-16 11:57:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:57:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:57:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:57:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:57:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:57:39,015 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-16 11:57:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:39,148 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-16 11:57:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:57:39,151 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-16 11:57:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:39,157 INFO L225 Difference]: With dead ends: 21 [2024-11-16 11:57:39,157 INFO L226 Difference]: Without dead ends: 10 [2024-11-16 11:57:39,160 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-16 11:57:39,164 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-16 11:57:39,165 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-16 11:57:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-16 11:57:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-16 11:57:39,204 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-16 11:57:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:57:39,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:57:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:39,206 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:57:39,206 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-16 11:57:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:57:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:57:39,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:39,207 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:57:39,218 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 (2)] Ended with exit code 0 [2024-11-16 11:57:39,414 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-16 11:57:39,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:57:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:57:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907414712] [2024-11-16 11:57:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:57:39,418 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-16 11:57:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:57:39,420 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-16 11:57:39,421 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-16 11:57:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:57:39,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 11:57:39,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:57:40,162 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-16 11:57:40,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:57:40,800 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-16 11:57:40,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:57:40,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907414712] [2024-11-16 11:57:40,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907414712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:57:40,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:57:40,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:57:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254658960] [2024-11-16 11:57:40,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:57:40,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:57:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:57:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:57:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:57:40,804 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 11:57:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:57:41,056 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 11:57:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:57:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) Word has length 9 [2024-11-16 11:57:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:57:41,060 INFO L225 Difference]: With dead ends: 16 [2024-11-16 11:57:41,060 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 11:57:41,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:57:41,061 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:57:41,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:57:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 11:57:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 11:57:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-16 11:57:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 11:57:41,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 11:57:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:57:41,065 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 11:57:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 11:57:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 11:57:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 11:57:41,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:57:41,065 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 11:57:41,073 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-16 11:57:41,269 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-16 11:57:41,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:57:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:57:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 11:57:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:57:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035883964] [2024-11-16 11:57:41,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:57:41,273 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-16 11:57:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:57:41,276 INFO L229 MonitoredProcess]: Starting monitored process 4 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-16 11:57:41,277 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 (4)] Waiting until timeout for monitored process [2024-11-16 11:57:41,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:57:41,957 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 11:57:41,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 11:57:41,997 INFO L278 TraceCheckSpWp]: Computing forward predicates...