./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:11:39,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:11:39,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:11:39,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:11:39,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:11:39,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:11:39,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:11:39,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:11:39,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:11:39,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:11:39,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:11:39,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:11:39,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:11:39,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:11:39,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:11:39,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:11:39,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:11:39,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:11:39,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:11:39,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:11:39,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:11:39,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:11:39,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:11:39,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:11:39,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:11:39,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:11:39,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:11:39,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:11:39,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:11:39,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:39,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:11:39,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:11:39,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:11:39,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:11:39,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:11:39,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:11:39,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:11:39,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:11:39,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:11:39,410 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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-11-10 02:11:39,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:11:39,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:11:39,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:11:39,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:11:39,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:11:39,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-10 02:11:41,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:11:41,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:11:41,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-10 02:11:41,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2313c1c/ff5c60def6794f7e8b774abb5d35bd36/FLAGd33f4bf92 [2024-11-10 02:11:41,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2313c1c/ff5c60def6794f7e8b774abb5d35bd36 [2024-11-10 02:11:41,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:11:41,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:11:41,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:41,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:11:41,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:11:41,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:41" (1/1) ... [2024-11-10 02:11:41,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714e389a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:41, skipping insertion in model container [2024-11-10 02:11:41,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:41" (1/1) ... [2024-11-10 02:11:41,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:11:41,712 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.h_b03.c[1245,1258] [2024-11-10 02:11:42,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:42,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:11:42,203 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.h_b03.c[1245,1258] [2024-11-10 02:11:42,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:42,296 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:11:42,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42 WrapperNode [2024-11-10 02:11:42,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:42,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:42,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:11:42,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:11:42,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,520 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1908 [2024-11-10 02:11:42,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:42,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:11:42,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:11:42,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:11:42,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,639 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-10 02:11:42,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:11:42,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:11:42,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:11:42,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:11:42,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (1/1) ... [2024-11-10 02:11:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:11:42,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:11:42,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:11:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:11:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:11:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 02:11:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:11:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:11:43,163 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:11:43,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:11:44,693 INFO L? ?]: Removed 1250 outVars from TransFormulas that were not future-live. [2024-11-10 02:11:44,693 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:11:44,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:11:44,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:11:44,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:11:44 BoogieIcfgContainer [2024-11-10 02:11:44,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:11:44,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:11:44,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:11:44,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:11:44,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:11:41" (1/3) ... [2024-11-10 02:11:44,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d90c21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:11:44, skipping insertion in model container [2024-11-10 02:11:44,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:42" (2/3) ... [2024-11-10 02:11:44,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d90c21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:11:44, skipping insertion in model container [2024-11-10 02:11:44,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:11:44" (3/3) ... [2024-11-10 02:11:44,779 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-11-10 02:11:44,793 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:11:44,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:11:44,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:11:44,852 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;@1ad84db6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:11:44,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:11:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 187 states have (on average 1.4866310160427807) internal successors, (278), 188 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 02:11:44,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:44,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:44,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash -778534452, now seen corresponding path program 1 times [2024-11-10 02:11:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328717322] [2024-11-10 02:11:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:45,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328717322] [2024-11-10 02:11:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328717322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:11:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686239358] [2024-11-10 02:11:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:45,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:11:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:11:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:45,470 INFO L87 Difference]: Start difference. First operand has 189 states, 187 states have (on average 1.4866310160427807) internal successors, (278), 188 states have internal predecessors, (278), 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 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:45,646 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2024-11-10 02:11:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:11:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2024-11-10 02:11:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:45,658 INFO L225 Difference]: With dead ends: 313 [2024-11-10 02:11:45,658 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 02:11:45,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:45,665 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:45,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 02:11:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-10 02:11:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.481081081081081) internal successors, (274), 185 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 274 transitions. [2024-11-10 02:11:45,709 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 274 transitions. Word has length 58 [2024-11-10 02:11:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 274 transitions. [2024-11-10 02:11:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2024-11-10 02:11:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 02:11:45,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:45,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:11:45,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1780289267, now seen corresponding path program 1 times [2024-11-10 02:11:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94484354] [2024-11-10 02:11:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94484354] [2024-11-10 02:11:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94484354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:45,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:45,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:11:45,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370430150] [2024-11-10 02:11:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:11:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:11:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:45,946 INFO L87 Difference]: Start difference. First operand 186 states and 274 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:46,075 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-10 02:11:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:11:46,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-10 02:11:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:46,078 INFO L225 Difference]: With dead ends: 312 [2024-11-10 02:11:46,078 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 02:11:46,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:46,080 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:46,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 02:11:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-10 02:11:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (276), 187 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2024-11-10 02:11:46,089 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 59 [2024-11-10 02:11:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:46,090 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2024-11-10 02:11:46,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2024-11-10 02:11:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 02:11:46,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:46,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:11:46,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -898363887, now seen corresponding path program 1 times [2024-11-10 02:11:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26792705] [2024-11-10 02:11:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26792705] [2024-11-10 02:11:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26792705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:46,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:11:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343002976] [2024-11-10 02:11:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:46,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:11:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:11:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:11:46,623 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:46,817 INFO L93 Difference]: Finished difference Result 318 states and 466 transitions. [2024-11-10 02:11:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:11:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 02:11:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:46,819 INFO L225 Difference]: With dead ends: 318 [2024-11-10 02:11:46,819 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 02:11:46,819 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-10 02:11:46,820 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 227 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:46,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 877 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 02:11:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2024-11-10 02:11:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 190 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2024-11-10 02:11:46,834 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 60 [2024-11-10 02:11:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:46,834 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2024-11-10 02:11:46,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2024-11-10 02:11:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 02:11:46,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:46,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:11:46,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash -599765048, now seen corresponding path program 1 times [2024-11-10 02:11:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256382452] [2024-11-10 02:11:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:46,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256382452] [2024-11-10 02:11:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256382452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:11:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383904891] [2024-11-10 02:11:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:11:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:11:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:11:47,780 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:47,971 INFO L93 Difference]: Finished difference Result 328 states and 478 transitions. [2024-11-10 02:11:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:11:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 02:11:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:47,973 INFO L225 Difference]: With dead ends: 328 [2024-11-10 02:11:47,974 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 02:11:47,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:11:47,976 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 252 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:47,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1107 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 02:11:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-10 02:11:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 195 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2024-11-10 02:11:47,996 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 61 [2024-11-10 02:11:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2024-11-10 02:11:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2024-11-10 02:11:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 02:11:47,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:47,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:11:47,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1320282509, now seen corresponding path program 1 times [2024-11-10 02:11:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:48,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879399338] [2024-11-10 02:11:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879399338] [2024-11-10 02:11:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879399338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:48,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:48,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564913908] [2024-11-10 02:11:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:48,223 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:48,513 INFO L93 Difference]: Finished difference Result 388 states and 557 transitions. [2024-11-10 02:11:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 02:11:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:48,515 INFO L225 Difference]: With dead ends: 388 [2024-11-10 02:11:48,515 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 02:11:48,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 02:11:48,516 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 376 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:48,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 652 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:11:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 02:11:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 198. [2024-11-10 02:11:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 197 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 287 transitions. [2024-11-10 02:11:48,530 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 287 transitions. Word has length 62 [2024-11-10 02:11:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:48,530 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 287 transitions. [2024-11-10 02:11:48,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 287 transitions. [2024-11-10 02:11:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 02:11:48,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:48,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:48,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:11:48,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:48,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 523115369, now seen corresponding path program 1 times [2024-11-10 02:11:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916244975] [2024-11-10 02:11:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916244975] [2024-11-10 02:11:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916244975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:11:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353024831] [2024-11-10 02:11:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:11:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:11:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:49,098 INFO L87 Difference]: Start difference. First operand 198 states and 287 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:49,295 INFO L93 Difference]: Finished difference Result 341 states and 493 transitions. [2024-11-10 02:11:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:11:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 02:11:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:49,296 INFO L225 Difference]: With dead ends: 341 [2024-11-10 02:11:49,297 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 02:11:49,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:49,300 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 249 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:49,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1314 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 02:11:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2024-11-10 02:11:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4527363184079602) internal successors, (292), 201 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 292 transitions. [2024-11-10 02:11:49,306 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 292 transitions. Word has length 62 [2024-11-10 02:11:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:49,308 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 292 transitions. [2024-11-10 02:11:49,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 292 transitions. [2024-11-10 02:11:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 02:11:49,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:49,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:11:49,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:49,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -911944818, now seen corresponding path program 1 times [2024-11-10 02:11:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064426869] [2024-11-10 02:11:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:49,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064426869] [2024-11-10 02:11:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064426869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681590697] [2024-11-10 02:11:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:49,564 INFO L87 Difference]: Start difference. First operand 202 states and 292 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:49,690 INFO L93 Difference]: Finished difference Result 392 states and 559 transitions. [2024-11-10 02:11:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 02:11:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:49,691 INFO L225 Difference]: With dead ends: 392 [2024-11-10 02:11:49,691 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 02:11:49,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 02:11:49,692 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 360 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:49,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 652 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 02:11:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2024-11-10 02:11:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 203 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2024-11-10 02:11:49,698 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 62 [2024-11-10 02:11:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:49,698 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2024-11-10 02:11:49,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2024-11-10 02:11:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 02:11:49,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:49,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:49,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:11:49,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:49,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1147057118, now seen corresponding path program 1 times [2024-11-10 02:11:49,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:49,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420102923] [2024-11-10 02:11:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420102923] [2024-11-10 02:11:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420102923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 02:11:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680308525] [2024-11-10 02:11:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 02:11:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 02:11:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:11:50,295 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:50,737 INFO L93 Difference]: Finished difference Result 357 states and 514 transitions. [2024-11-10 02:11:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 02:11:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 02:11:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:50,739 INFO L225 Difference]: With dead ends: 357 [2024-11-10 02:11:50,739 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 02:11:50,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:11:50,740 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 256 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:50,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1929 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:11:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 02:11:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2024-11-10 02:11:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4481132075471699) internal successors, (307), 212 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2024-11-10 02:11:50,745 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 63 [2024-11-10 02:11:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:50,746 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2024-11-10 02:11:50,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2024-11-10 02:11:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 02:11:50,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:50,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:50,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:11:50,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:50,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1377291740, now seen corresponding path program 1 times [2024-11-10 02:11:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:50,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173698236] [2024-11-10 02:11:50,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173698236] [2024-11-10 02:11:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173698236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541961143] [2024-11-10 02:11:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:50,924 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:51,067 INFO L93 Difference]: Finished difference Result 412 states and 586 transitions. [2024-11-10 02:11:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 02:11:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:51,068 INFO L225 Difference]: With dead ends: 412 [2024-11-10 02:11:51,069 INFO L226 Difference]: Without dead ends: 265 [2024-11-10 02:11:51,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 02:11:51,070 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 342 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:51,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 652 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-10 02:11:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 230. [2024-11-10 02:11:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4323144104803494) internal successors, (328), 229 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2024-11-10 02:11:51,075 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 64 [2024-11-10 02:11:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:51,076 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2024-11-10 02:11:51,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2024-11-10 02:11:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 02:11:51,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:51,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:11:51,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1319598849, now seen corresponding path program 1 times [2024-11-10 02:11:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706549101] [2024-11-10 02:11:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:51,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706549101] [2024-11-10 02:11:51,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706549101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:51,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:51,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 02:11:51,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678800435] [2024-11-10 02:11:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:51,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 02:11:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 02:11:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 02:11:51,667 INFO L87 Difference]: Start difference. First operand 230 states and 328 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:52,123 INFO L93 Difference]: Finished difference Result 391 states and 559 transitions. [2024-11-10 02:11:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 02:11:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 02:11:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:52,125 INFO L225 Difference]: With dead ends: 391 [2024-11-10 02:11:52,125 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 02:11:52,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-10 02:11:52,126 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 265 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:52,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2550 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:11:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 02:11:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2024-11-10 02:11:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.4303797468354431) internal successors, (339), 237 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 339 transitions. [2024-11-10 02:11:52,131 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 339 transitions. Word has length 64 [2024-11-10 02:11:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:52,131 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 339 transitions. [2024-11-10 02:11:52,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 339 transitions. [2024-11-10 02:11:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 02:11:52,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:52,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:52,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:11:52,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -94647707, now seen corresponding path program 1 times [2024-11-10 02:11:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358918510] [2024-11-10 02:11:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358918510] [2024-11-10 02:11:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358918510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 02:11:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16569928] [2024-11-10 02:11:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 02:11:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:52,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 02:11:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:11:52,674 INFO L87 Difference]: Start difference. First operand 238 states and 339 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:53,287 INFO L93 Difference]: Finished difference Result 420 states and 598 transitions. [2024-11-10 02:11:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 02:11:53,288 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 02:11:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:53,289 INFO L225 Difference]: With dead ends: 420 [2024-11-10 02:11:53,289 INFO L226 Difference]: Without dead ends: 265 [2024-11-10 02:11:53,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-10 02:11:53,290 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 269 mSDsluCounter, 2929 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:53,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 3142 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:11:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-10 02:11:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2024-11-10 02:11:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.4280155642023347) internal successors, (367), 257 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 367 transitions. [2024-11-10 02:11:53,294 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 367 transitions. Word has length 64 [2024-11-10 02:11:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 367 transitions. [2024-11-10 02:11:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 367 transitions. [2024-11-10 02:11:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 02:11:53,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:53,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:11:53,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:53,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1375905900, now seen corresponding path program 1 times [2024-11-10 02:11:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236921964] [2024-11-10 02:11:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:53,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236921964] [2024-11-10 02:11:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236921964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968528016] [2024-11-10 02:11:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:53,675 INFO L87 Difference]: Start difference. First operand 258 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:53,825 INFO L93 Difference]: Finished difference Result 439 states and 627 transitions. [2024-11-10 02:11:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 02:11:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:53,827 INFO L225 Difference]: With dead ends: 439 [2024-11-10 02:11:53,827 INFO L226 Difference]: Without dead ends: 263 [2024-11-10 02:11:53,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:11:53,828 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 234 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:53,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 669 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-10 02:11:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-10 02:11:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4236641221374047) internal successors, (373), 262 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2024-11-10 02:11:53,835 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 64 [2024-11-10 02:11:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:53,835 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2024-11-10 02:11:53,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2024-11-10 02:11:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 02:11:53,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:53,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:53,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:11:53,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:53,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:53,837 INFO L85 PathProgramCache]: Analyzing trace with hash -189559712, now seen corresponding path program 1 times [2024-11-10 02:11:53,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:53,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997010331] [2024-11-10 02:11:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997010331] [2024-11-10 02:11:54,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997010331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:54,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465160676] [2024-11-10 02:11:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:54,028 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:54,162 INFO L93 Difference]: Finished difference Result 484 states and 683 transitions. [2024-11-10 02:11:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 02:11:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:54,164 INFO L225 Difference]: With dead ends: 484 [2024-11-10 02:11:54,164 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 02:11:54,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 02:11:54,166 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 331 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:54,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 652 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 02:11:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 253. [2024-11-10 02:11:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4246031746031746) internal successors, (359), 252 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 359 transitions. [2024-11-10 02:11:54,174 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 359 transitions. Word has length 64 [2024-11-10 02:11:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:54,175 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 359 transitions. [2024-11-10 02:11:54,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 359 transitions. [2024-11-10 02:11:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 02:11:54,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:54,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:54,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:11:54,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:54,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash 354821529, now seen corresponding path program 1 times [2024-11-10 02:11:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104164453] [2024-11-10 02:11:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:54,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104164453] [2024-11-10 02:11:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104164453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:54,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780848047] [2024-11-10 02:11:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:54,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:54,372 INFO L87 Difference]: Start difference. First operand 253 states and 359 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:54,497 INFO L93 Difference]: Finished difference Result 466 states and 658 transitions. [2024-11-10 02:11:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 02:11:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:54,499 INFO L225 Difference]: With dead ends: 466 [2024-11-10 02:11:54,499 INFO L226 Difference]: Without dead ends: 289 [2024-11-10 02:11:54,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 02:11:54,500 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 313 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:54,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 652 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-10 02:11:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 261. [2024-11-10 02:11:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4153846153846155) internal successors, (368), 260 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 368 transitions. [2024-11-10 02:11:54,505 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 368 transitions. Word has length 65 [2024-11-10 02:11:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 368 transitions. [2024-11-10 02:11:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 368 transitions. [2024-11-10 02:11:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 02:11:54,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:54,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 02:11:54,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1454367244, now seen corresponding path program 1 times [2024-11-10 02:11:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443908458] [2024-11-10 02:11:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:54,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:11:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:54,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:11:54,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:11:54,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:11:54,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:11:54,639 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:54,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:11:54,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:11:54 BoogieIcfgContainer [2024-11-10 02:11:54,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:11:54,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:11:54,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:11:54,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:11:54,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:11:44" (3/4) ... [2024-11-10 02:11:54,713 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:11:54,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:11:54,715 INFO L158 Benchmark]: Toolchain (without parser) took 13256.00ms. Allocated memory was 127.9MB in the beginning and 880.8MB in the end (delta: 752.9MB). Free memory was 75.5MB in the beginning and 512.9MB in the end (delta: -437.4MB). Peak memory consumption was 317.4MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,715 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.5MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:54,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 836.89ms. Allocated memory is still 127.9MB. Free memory was 75.0MB in the beginning and 67.9MB in the end (delta: 7.0MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 226.63ms. Allocated memory was 127.9MB in the beginning and 213.9MB in the end (delta: 86.0MB). Free memory was 67.9MB in the beginning and 168.0MB in the end (delta: -100.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,719 INFO L158 Benchmark]: Boogie Preprocessor took 268.00ms. Allocated memory is still 213.9MB. Free memory was 168.0MB in the beginning and 160.2MB in the end (delta: 7.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,720 INFO L158 Benchmark]: IcfgBuilder took 1977.18ms. Allocated memory was 213.9MB in the beginning and 427.8MB in the end (delta: 213.9MB). Free memory was 160.2MB in the beginning and 366.5MB in the end (delta: -206.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,720 INFO L158 Benchmark]: TraceAbstraction took 9932.81ms. Allocated memory was 427.8MB in the beginning and 880.8MB in the end (delta: 453.0MB). Free memory was 366.5MB in the beginning and 513.9MB in the end (delta: -147.4MB). Peak memory consumption was 305.5MB. Max. memory is 16.1GB. [2024-11-10 02:11:54,720 INFO L158 Benchmark]: Witness Printer took 8.10ms. Allocated memory is still 880.8MB. Free memory was 513.9MB in the beginning and 512.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:54,721 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.15ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.5MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 836.89ms. Allocated memory is still 127.9MB. Free memory was 75.0MB in the beginning and 67.9MB in the end (delta: 7.0MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 226.63ms. Allocated memory was 127.9MB in the beginning and 213.9MB in the end (delta: 86.0MB). Free memory was 67.9MB in the beginning and 168.0MB in the end (delta: -100.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 268.00ms. Allocated memory is still 213.9MB. Free memory was 168.0MB in the beginning and 160.2MB in the end (delta: 7.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1977.18ms. Allocated memory was 213.9MB in the beginning and 427.8MB in the end (delta: 213.9MB). Free memory was 160.2MB in the beginning and 366.5MB in the end (delta: -206.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9932.81ms. Allocated memory was 427.8MB in the beginning and 880.8MB in the end (delta: 453.0MB). Free memory was 366.5MB in the beginning and 513.9MB in the end (delta: -147.4MB). Peak memory consumption was 305.5MB. Max. memory is 16.1GB. * Witness Printer took 8.10ms. Allocated memory is still 880.8MB. Free memory was 513.9MB in the beginning and 512.9MB in the end (delta: 1.0MB). 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 375. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 32); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (32 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 3); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (3 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 2); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_11 var_13 = 0; [L43] const SORT_11 var_16 = 8; [L44] const SORT_11 var_20 = 4; [L45] const SORT_11 var_24 = 2; [L46] const SORT_11 var_28 = 1; [L47] const SORT_1 var_33 = 1; [L48] const SORT_37 var_38 = 0; [L49] const SORT_1 var_47 = 0; [L50] const SORT_67 var_68 = 0; [L51] const SORT_67 var_71 = 1; [L52] const SORT_37 var_81 = 7; [L53] const SORT_37 var_104 = 1; [L54] const SORT_37 var_123 = 2; [L55] const SORT_37 var_138 = 4; [L56] const SORT_67 var_154 = 2; [L57] const SORT_7 var_394 = 8; [L58] const SORT_7 var_397 = 4; [L59] const SORT_7 var_400 = 2; [L60] const SORT_7 var_401 = 1; [L62] SORT_1 input_2; [L63] SORT_1 input_3; [L64] SORT_1 input_4; [L65] SORT_1 input_5; [L66] SORT_1 input_6; [L67] SORT_37 input_75; [L68] SORT_37 input_76; [L69] SORT_37 input_77; [L70] SORT_37 input_78; [L71] SORT_37 input_79; [L72] SORT_37 input_80; [L73] SORT_37 input_85; [L74] SORT_37 input_87; [L75] SORT_37 input_89; [L76] SORT_37 input_94; [L77] SORT_37 input_96; [L78] SORT_37 input_98; [L79] SORT_37 input_102; [L80] SORT_37 input_103; [L81] SORT_37 input_108; [L82] SORT_37 input_110; [L83] SORT_37 input_115; [L84] SORT_37 input_117; [L85] SORT_37 input_121; [L86] SORT_37 input_122; [L87] SORT_37 input_127; [L88] SORT_37 input_132; [L89] SORT_37 input_136; [L90] SORT_37 input_137; [L91] SORT_37 input_149; [L92] SORT_37 input_160; [L93] SORT_37 input_161; [L94] SORT_37 input_162; [L95] SORT_37 input_163; [L96] SORT_37 input_164; [L97] SORT_37 input_165; [L98] SORT_37 input_168; [L99] SORT_37 input_170; [L100] SORT_37 input_172; [L101] SORT_37 input_177; [L102] SORT_37 input_179; [L103] SORT_37 input_181; [L104] SORT_37 input_185; [L105] SORT_37 input_186; [L106] SORT_37 input_189; [L107] SORT_37 input_191; [L108] SORT_37 input_196; [L109] SORT_37 input_198; [L110] SORT_37 input_202; [L111] SORT_37 input_203; [L112] SORT_37 input_206; [L113] SORT_37 input_211; [L114] SORT_37 input_215; [L115] SORT_37 input_216; [L116] SORT_37 input_226; [L117] SORT_37 input_233; [L118] SORT_37 input_234; [L119] SORT_37 input_235; [L120] SORT_37 input_236; [L121] SORT_37 input_237; [L122] SORT_37 input_238; [L123] SORT_37 input_241; [L124] SORT_37 input_243; [L125] SORT_37 input_245; [L126] SORT_37 input_250; [L127] SORT_37 input_252; [L128] SORT_37 input_254; [L129] SORT_37 input_258; [L130] SORT_37 input_259; [L131] SORT_37 input_262; [L132] SORT_37 input_264; [L133] SORT_37 input_269; [L134] SORT_37 input_271; [L135] SORT_37 input_275; [L136] SORT_37 input_276; [L137] SORT_37 input_279; [L138] SORT_37 input_284; [L139] SORT_37 input_288; [L140] SORT_37 input_289; [L141] SORT_37 input_299; [L142] SORT_37 input_306; [L143] SORT_37 input_307; [L144] SORT_37 input_308; [L145] SORT_37 input_309; [L146] SORT_37 input_310; [L147] SORT_37 input_311; [L148] SORT_37 input_314; [L149] SORT_37 input_316; [L150] SORT_37 input_318; [L151] SORT_37 input_323; [L152] SORT_37 input_325; [L153] SORT_37 input_327; [L154] SORT_37 input_331; [L155] SORT_37 input_332; [L156] SORT_37 input_335; [L157] SORT_37 input_337; [L158] SORT_37 input_342; [L159] SORT_37 input_344; [L160] SORT_37 input_348; [L161] SORT_37 input_349; [L162] SORT_37 input_352; [L163] SORT_37 input_357; [L164] SORT_37 input_361; [L165] SORT_37 input_362; [L166] SORT_37 input_372; [L167] SORT_7 input_391; [L168] SORT_7 input_392; [L169] SORT_7 input_393; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L171] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L172] SORT_37 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L173] SORT_37 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L174] SORT_37 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L175] SORT_37 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L176] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L177] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L178] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L179] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L180] SORT_7 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L181] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L182] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L183] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L184] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L185] EXPR __VERIFIER_nondet_uchar() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L185] SORT_67 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_67; [L187] SORT_7 init_10_arg_1 = var_8; [L188] state_9 = init_10_arg_1 [L189] SORT_37 init_40_arg_1 = var_38; [L190] state_39 = init_40_arg_1 [L191] SORT_37 init_42_arg_1 = var_38; [L192] state_41 = init_42_arg_1 [L193] SORT_37 init_44_arg_1 = var_38; [L194] state_43 = init_44_arg_1 [L195] SORT_37 init_46_arg_1 = var_38; [L196] state_45 = init_46_arg_1 [L197] SORT_1 init_49_arg_1 = var_47; [L198] state_48 = init_49_arg_1 [L199] SORT_1 init_51_arg_1 = var_47; [L200] state_50 = init_51_arg_1 [L201] SORT_1 init_53_arg_1 = var_47; [L202] state_52 = init_53_arg_1 [L203] SORT_1 init_55_arg_1 = var_47; [L204] state_54 = init_55_arg_1 [L205] SORT_7 init_57_arg_1 = var_8; [L206] state_56 = init_57_arg_1 [L207] SORT_1 init_60_arg_1 = var_47; [L208] state_59 = init_60_arg_1 [L209] SORT_1 init_62_arg_1 = var_47; [L210] state_61 = init_62_arg_1 [L211] SORT_1 init_64_arg_1 = var_47; [L212] state_63 = init_64_arg_1 [L213] SORT_1 init_66_arg_1 = var_47; [L214] state_65 = init_66_arg_1 [L215] SORT_67 init_70_arg_1 = var_68; [L216] state_69 = init_70_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L219] input_2 = __VERIFIER_nondet_uchar() [L220] input_3 = __VERIFIER_nondet_uchar() [L221] input_4 = __VERIFIER_nondet_uchar() [L222] input_5 = __VERIFIER_nondet_uchar() [L223] input_6 = __VERIFIER_nondet_uchar() [L224] input_75 = __VERIFIER_nondet_uchar() [L225] input_76 = __VERIFIER_nondet_uchar() [L226] input_77 = __VERIFIER_nondet_uchar() [L227] input_78 = __VERIFIER_nondet_uchar() [L228] input_79 = __VERIFIER_nondet_uchar() [L229] input_80 = __VERIFIER_nondet_uchar() [L230] input_85 = __VERIFIER_nondet_uchar() [L231] input_87 = __VERIFIER_nondet_uchar() [L232] input_89 = __VERIFIER_nondet_uchar() [L233] input_94 = __VERIFIER_nondet_uchar() [L234] input_96 = __VERIFIER_nondet_uchar() [L235] input_98 = __VERIFIER_nondet_uchar() [L236] input_102 = __VERIFIER_nondet_uchar() [L237] input_103 = __VERIFIER_nondet_uchar() [L238] input_108 = __VERIFIER_nondet_uchar() [L239] input_110 = __VERIFIER_nondet_uchar() [L240] input_115 = __VERIFIER_nondet_uchar() [L241] input_117 = __VERIFIER_nondet_uchar() [L242] input_121 = __VERIFIER_nondet_uchar() [L243] input_122 = __VERIFIER_nondet_uchar() [L244] input_127 = __VERIFIER_nondet_uchar() [L245] input_132 = __VERIFIER_nondet_uchar() [L246] input_136 = __VERIFIER_nondet_uchar() [L247] input_137 = __VERIFIER_nondet_uchar() [L248] input_149 = __VERIFIER_nondet_uchar() [L249] input_160 = __VERIFIER_nondet_uchar() [L250] input_161 = __VERIFIER_nondet_uchar() [L251] input_162 = __VERIFIER_nondet_uchar() [L252] input_163 = __VERIFIER_nondet_uchar() [L253] input_164 = __VERIFIER_nondet_uchar() [L254] input_165 = __VERIFIER_nondet_uchar() [L255] input_168 = __VERIFIER_nondet_uchar() [L256] input_170 = __VERIFIER_nondet_uchar() [L257] input_172 = __VERIFIER_nondet_uchar() [L258] input_177 = __VERIFIER_nondet_uchar() [L259] input_179 = __VERIFIER_nondet_uchar() [L260] input_181 = __VERIFIER_nondet_uchar() [L261] input_185 = __VERIFIER_nondet_uchar() [L262] input_186 = __VERIFIER_nondet_uchar() [L263] input_189 = __VERIFIER_nondet_uchar() [L264] input_191 = __VERIFIER_nondet_uchar() [L265] input_196 = __VERIFIER_nondet_uchar() [L266] input_198 = __VERIFIER_nondet_uchar() [L267] input_202 = __VERIFIER_nondet_uchar() [L268] input_203 = __VERIFIER_nondet_uchar() [L269] input_206 = __VERIFIER_nondet_uchar() [L270] input_211 = __VERIFIER_nondet_uchar() [L271] input_215 = __VERIFIER_nondet_uchar() [L272] input_216 = __VERIFIER_nondet_uchar() [L273] input_226 = __VERIFIER_nondet_uchar() [L274] input_233 = __VERIFIER_nondet_uchar() [L275] input_234 = __VERIFIER_nondet_uchar() [L276] input_235 = __VERIFIER_nondet_uchar() [L277] input_236 = __VERIFIER_nondet_uchar() [L278] input_237 = __VERIFIER_nondet_uchar() [L279] input_238 = __VERIFIER_nondet_uchar() [L280] input_241 = __VERIFIER_nondet_uchar() [L281] input_243 = __VERIFIER_nondet_uchar() [L282] input_245 = __VERIFIER_nondet_uchar() [L283] input_250 = __VERIFIER_nondet_uchar() [L284] input_252 = __VERIFIER_nondet_uchar() [L285] input_254 = __VERIFIER_nondet_uchar() [L286] input_258 = __VERIFIER_nondet_uchar() [L287] input_259 = __VERIFIER_nondet_uchar() [L288] input_262 = __VERIFIER_nondet_uchar() [L289] input_264 = __VERIFIER_nondet_uchar() [L290] input_269 = __VERIFIER_nondet_uchar() [L291] input_271 = __VERIFIER_nondet_uchar() [L292] input_275 = __VERIFIER_nondet_uchar() [L293] input_276 = __VERIFIER_nondet_uchar() [L294] input_279 = __VERIFIER_nondet_uchar() [L295] input_284 = __VERIFIER_nondet_uchar() [L296] input_288 = __VERIFIER_nondet_uchar() [L297] input_289 = __VERIFIER_nondet_uchar() [L298] input_299 = __VERIFIER_nondet_uchar() [L299] input_306 = __VERIFIER_nondet_uchar() [L300] input_307 = __VERIFIER_nondet_uchar() [L301] input_308 = __VERIFIER_nondet_uchar() [L302] input_309 = __VERIFIER_nondet_uchar() [L303] input_310 = __VERIFIER_nondet_uchar() [L304] input_311 = __VERIFIER_nondet_uchar() [L305] input_314 = __VERIFIER_nondet_uchar() [L306] input_316 = __VERIFIER_nondet_uchar() [L307] input_318 = __VERIFIER_nondet_uchar() [L308] input_323 = __VERIFIER_nondet_uchar() [L309] input_325 = __VERIFIER_nondet_uchar() [L310] input_327 = __VERIFIER_nondet_uchar() [L311] input_331 = __VERIFIER_nondet_uchar() [L312] input_332 = __VERIFIER_nondet_uchar() [L313] input_335 = __VERIFIER_nondet_uchar() [L314] input_337 = __VERIFIER_nondet_uchar() [L315] input_342 = __VERIFIER_nondet_uchar() [L316] input_344 = __VERIFIER_nondet_uchar() [L317] input_348 = __VERIFIER_nondet_uchar() [L318] input_349 = __VERIFIER_nondet_uchar() [L319] input_352 = __VERIFIER_nondet_uchar() [L320] input_357 = __VERIFIER_nondet_uchar() [L321] input_361 = __VERIFIER_nondet_uchar() [L322] input_362 = __VERIFIER_nondet_uchar() [L323] input_372 = __VERIFIER_nondet_uchar() [L324] input_391 = __VERIFIER_nondet_uchar() [L325] input_392 = __VERIFIER_nondet_uchar() [L326] input_393 = __VERIFIER_nondet_uchar() [L329] SORT_7 var_12_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_12_arg_0=0, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] EXPR var_12_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] var_12_arg_0 = var_12_arg_0 & mask_SORT_7 [L331] SORT_11 var_12 = var_12_arg_0; [L332] SORT_11 var_14_arg_0 = var_12; [L333] SORT_11 var_14_arg_1 = var_13; [L334] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L335] SORT_7 var_15_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_15_arg_0=0, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] EXPR var_15_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] var_15_arg_0 = var_15_arg_0 & mask_SORT_7 [L337] SORT_11 var_15 = var_15_arg_0; [L338] SORT_11 var_17_arg_0 = var_15; [L339] SORT_11 var_17_arg_1 = var_16; [L340] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L341] SORT_1 var_18_arg_0 = var_14; [L342] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18_arg_0=1, var_18_arg_1=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L344] SORT_7 var_19_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_19_arg_0=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] EXPR var_19_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] var_19_arg_0 = var_19_arg_0 & mask_SORT_7 [L346] SORT_11 var_19 = var_19_arg_0; [L347] SORT_11 var_21_arg_0 = var_19; [L348] SORT_11 var_21_arg_1 = var_20; [L349] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L350] SORT_1 var_22_arg_0 = var_18; [L351] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22_arg_0=1, var_22_arg_1=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L353] SORT_7 var_23_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_23_arg_0=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] EXPR var_23_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] var_23_arg_0 = var_23_arg_0 & mask_SORT_7 [L355] SORT_11 var_23 = var_23_arg_0; [L356] SORT_11 var_25_arg_0 = var_23; [L357] SORT_11 var_25_arg_1 = var_24; [L358] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L359] SORT_1 var_26_arg_0 = var_22; [L360] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26_arg_0=1, var_26_arg_1=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L362] SORT_7 var_27_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_27_arg_0=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] EXPR var_27_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] var_27_arg_0 = var_27_arg_0 & mask_SORT_7 [L364] SORT_11 var_27 = var_27_arg_0; [L365] SORT_11 var_29_arg_0 = var_27; [L366] SORT_11 var_29_arg_1 = var_28; [L367] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L368] SORT_1 var_30_arg_0 = var_26; [L369] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_30_arg_0=1, var_30_arg_1=0, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L371] SORT_1 var_34_arg_0 = var_30; [L372] SORT_1 var_34 = ~var_34_arg_0; [L373] SORT_1 var_35_arg_0 = var_33; [L374] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_35_arg_0=1, var_35_arg_1=-2, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] EXPR var_35_arg_0 & var_35_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L376] EXPR var_35 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L376] var_35 = var_35 & mask_SORT_1 [L377] SORT_1 bad_36_arg_0 = var_35; [L378] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3474 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3474 mSDsluCounter, 16191 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13106 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4362 IncrementalHoareTripleChecker+Invalid, 4369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 3085 mSDtfsCounter, 4362 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=12, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 239 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 02:11:54,784 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.h_b03.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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:11:57,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:11:57,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:11:57,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:11:57,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:11:57,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:11:57,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:11:57,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:11:57,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:11:57,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:11:57,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:11:57,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:11:57,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:11:57,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:11:57,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:11:57,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:11:57,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:11:57,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:11:57,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:11:57,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:11:57,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:11:57,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:11:57,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:11:57,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:11:57,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:11:57,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:11:57,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:57,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:11:57,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:11:57,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:11:57,149 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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-11-10 02:11:57,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:11:57,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:11:57,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:11:57,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:11:57,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:11:57,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-10 02:11:59,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:11:59,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:11:59,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-10 02:11:59,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca009e729/6788dab166094e3094abeaf5c90cbf33/FLAG49c54e72c [2024-11-10 02:11:59,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca009e729/6788dab166094e3094abeaf5c90cbf33 [2024-11-10 02:11:59,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:11:59,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:11:59,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:59,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:11:59,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:11:59,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:59" (1/1) ... [2024-11-10 02:11:59,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c3c186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:59, skipping insertion in model container [2024-11-10 02:11:59,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:59" (1/1) ... [2024-11-10 02:11:59,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:11:59,683 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.h_b03.c[1245,1258] [2024-11-10 02:11:59,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:59,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:12:00,010 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.h_b03.c[1245,1258] [2024-11-10 02:12:00,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:12:00,126 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:12:00,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00 WrapperNode [2024-11-10 02:12:00,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:12:00,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:12:00,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:12:00,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:12:00,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,237 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1556 [2024-11-10 02:12:00,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:12:00,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:12:00,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:12:00,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:12:00,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,281 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-10 02:12:00,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:12:00,318 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:12:00,318 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:12:00,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:12:00,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (1/1) ... [2024-11-10 02:12:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:12:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:12:00,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:12:00,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:12:00,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:12:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:12:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 02:12:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:12:00,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:12:00,683 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:12:00,685 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:12:01,474 INFO L? ?]: Removed 177 outVars from TransFormulas that were not future-live. [2024-11-10 02:12:01,475 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:12:01,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:12:01,487 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:12:01,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:12:01 BoogieIcfgContainer [2024-11-10 02:12:01,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:12:01,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:12:01,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:12:01,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:12:01,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:11:59" (1/3) ... [2024-11-10 02:12:01,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:12:01, skipping insertion in model container [2024-11-10 02:12:01,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:12:00" (2/3) ... [2024-11-10 02:12:01,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:12:01, skipping insertion in model container [2024-11-10 02:12:01,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:12:01" (3/3) ... [2024-11-10 02:12:01,500 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-11-10 02:12:01,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:12:01,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:12:01,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:12:01,584 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;@5ffb8e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:12:01,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:12:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:12:01,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:12:01,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:12:01,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:12:01,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:12:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:12:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:12:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781369737] [2024-11-10 02:12:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:12:01,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:01,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:12:01,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:12:01,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 02:12:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:12:02,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 02:12:02,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:12:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:02,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:12:02,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:12:02,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781369737] [2024-11-10 02:12:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781369737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:12:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:12:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:12:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447829915] [2024-11-10 02:12:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:12:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:12:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:12:02,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:12:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:12:02,235 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:12:02,296 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:12:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:12:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 02:12:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:12:02,305 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:12:02,305 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:12:02,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:12:02,310 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:12:02,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:12:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:12:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:12:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:12:02,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:12:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:12:02,337 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:12:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:12:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:12:02,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:12:02,338 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:12:02,346 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-10 02:12:02,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:02,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:12:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:12:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:12:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:12:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388403049] [2024-11-10 02:12:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:12:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:12:02,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:12:02,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 02:12:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:12:02,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 02:12:02,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:12:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:03,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:12:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:03,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:12:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388403049] [2024-11-10 02:12:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388403049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:12:03,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:12:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 02:12:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325119389] [2024-11-10 02:12:03,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:12:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:12:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:12:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:12:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:12:03,423 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-10 02:12:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:12:03,514 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-10 02:12:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:12:03,514 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-10 02:12:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:12:03,515 INFO L225 Difference]: With dead ends: 17 [2024-11-10 02:12:03,515 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 02:12:03,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:12:03,516 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:12:03,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:12:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 02:12:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-10 02:12:03,519 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-10 02:12:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 02:12:03,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 02:12:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:12:03,519 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 02:12:03,520 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-10 02:12:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 02:12:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 02:12:03,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:12:03,520 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 02:12:03,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 02:12:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:03,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:12:03,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:12:03,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 02:12:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:12:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385916173] [2024-11-10 02:12:03,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 02:12:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:12:03,725 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-10 02:12:03,728 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-10 02:12:04,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 02:12:04,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:12:04,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 02:12:04,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:12:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:13,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:12:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:43,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:12:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385916173] [2024-11-10 02:12:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385916173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:12:43,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:12:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 02:12:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048018238] [2024-11-10 02:12:43,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:12:43,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:12:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:12:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:12:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:12:43,345 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:12:43,628 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-10 02:12:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:12:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 12 [2024-11-10 02:12:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:12:43,629 INFO L225 Difference]: With dead ends: 20 [2024-11-10 02:12:43,629 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 02:12:43,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-10 02:12:43,632 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:12:43,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:12:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 02:12:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-10 02:12:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-10 02:12:43,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-11-10 02:12:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:12:43,636 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-10 02:12:43,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:12:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-10 02:12:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 02:12:43,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:12:43,637 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-10 02:12:43,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 02:12:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:43,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:12:43,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:12:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 3 times [2024-11-10 02:12:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:12:43,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233667937] [2024-11-10 02:12:43,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 02:12:43,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:12:43,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:12:43,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:12:43,850 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 (5)] Waiting until timeout for monitored process [2024-11-10 02:12:44,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 02:12:44,565 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:12:44,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 02:12:44,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:12:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:12:45,896 INFO L311 TraceCheckSpWp]: Computing backward predicates...