./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:56:36,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:56:36,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:56:36,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:56:36,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:56:36,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:56:36,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:56:36,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:56:36,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:56:36,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:56:36,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:56:36,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:56:36,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:56:36,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:56:36,157 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:56:36,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:56:36,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:56:36,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:56:36,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:56:36,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:56:36,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:56:36,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:56:36,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:56:36,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:56:36,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:56:36,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:56:36,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:56:36,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:56:36,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:56:36,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:36,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:56:36,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:56:36,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:56:36,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:56:36,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:56:36,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:56:36,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:56:36,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:56:36,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:56:36,169 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2024-11-12 00:56:36,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:56:36,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:56:36,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:56:36,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:56:36,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:56:36,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:56:38,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:56:38,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:56:38,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:56:38,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa934ebb/61ec3abbd83a4bd3987da1e1bb128308/FLAG4e767a29f [2024-11-12 00:56:38,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa934ebb/61ec3abbd83a4bd3987da1e1bb128308 [2024-11-12 00:56:38,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:56:38,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:56:38,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:56:38,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:56:38,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:56:38,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:38" (1/1) ... [2024-11-12 00:56:38,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ea9ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:38, skipping insertion in model container [2024-11-12 00:56:38,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:38" (1/1) ... [2024-11-12 00:56:38,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:56:38,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-11-12 00:56:39,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:56:39,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:56:39,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-11-12 00:56:39,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:56:39,415 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:56:39,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39 WrapperNode [2024-11-12 00:56:39,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:56:39,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:56:39,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:56:39,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:56:39,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:39,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:39,996 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4515 [2024-11-12 00:56:39,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:56:39,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:56:39,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:56:39,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:56:40,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:56:40,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:56:40,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:56:40,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:56:40,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:56:40,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (1/1) ... [2024-11-12 00:56:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:40,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:56:40,933 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-12 00:56:40,963 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-12 00:56:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:56:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:56:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:56:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:56:41,495 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:56:41,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:56:45,813 INFO L? ?]: Removed 2689 outVars from TransFormulas that were not future-live. [2024-11-12 00:56:45,813 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:56:45,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:56:45,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:56:45,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:45 BoogieIcfgContainer [2024-11-12 00:56:45,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:56:45,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:56:45,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:56:45,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:56:45,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:38" (1/3) ... [2024-11-12 00:56:45,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d5e772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:45, skipping insertion in model container [2024-11-12 00:56:45,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:39" (2/3) ... [2024-11-12 00:56:45,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d5e772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:45, skipping insertion in model container [2024-11-12 00:56:45,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:45" (3/3) ... [2024-11-12 00:56:45,870 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:56:45,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:56:45,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:56:45,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:56:45,995 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;@5eb6b3a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:56:45,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:56:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 1351 states, 1349 states have (on average 1.4996293550778355) internal successors, (2023), 1350 states have internal predecessors, (2023), 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-12 00:56:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 00:56:46,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:46,016 INFO L218 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] [2024-11-12 00:56:46,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:46,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1156434564, now seen corresponding path program 1 times [2024-11-12 00:56:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558193878] [2024-11-12 00:56:46,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:46,675 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-12 00:56:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558193878] [2024-11-12 00:56:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558193878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:56:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937958847] [2024-11-12 00:56:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:56:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:46,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:56:46,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:56:46,714 INFO L87 Difference]: Start difference. First operand has 1351 states, 1349 states have (on average 1.4996293550778355) internal successors, (2023), 1350 states have internal predecessors, (2023), 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 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 00:56:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:46,869 INFO L93 Difference]: Finished difference Result 2647 states and 3967 transitions. [2024-11-12 00:56:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:56:46,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-12 00:56:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:46,898 INFO L225 Difference]: With dead ends: 2647 [2024-11-12 00:56:46,899 INFO L226 Difference]: Without dead ends: 1350 [2024-11-12 00:56:46,904 INFO L434 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-12 00:56:46,908 INFO L435 NwaCegarLoop]: 2017 mSDtfsCounter, 0 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6045 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:46,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6045 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-12 00:56:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2024-11-12 00:56:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.498146775389177) internal successors, (2021), 1349 states have internal predecessors, (2021), 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-12 00:56:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2021 transitions. [2024-11-12 00:56:46,999 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2021 transitions. Word has length 47 [2024-11-12 00:56:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:47,000 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2021 transitions. [2024-11-12 00:56:47,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 00:56:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2021 transitions. [2024-11-12 00:56:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:56:47,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:47,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:47,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:56:47,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1488037690, now seen corresponding path program 1 times [2024-11-12 00:56:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619529185] [2024-11-12 00:56:47,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:47,239 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-12 00:56:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619529185] [2024-11-12 00:56:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619529185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:47,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:47,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:56:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820979187] [2024-11-12 00:56:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:56:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:47,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:56:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:56:47,245 INFO L87 Difference]: Start difference. First operand 1350 states and 2021 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:47,310 INFO L93 Difference]: Finished difference Result 2648 states and 3965 transitions. [2024-11-12 00:56:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:56:47,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 00:56:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:47,316 INFO L225 Difference]: With dead ends: 2648 [2024-11-12 00:56:47,317 INFO L226 Difference]: Without dead ends: 1352 [2024-11-12 00:56:47,319 INFO L434 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-12 00:56:47,320 INFO L435 NwaCegarLoop]: 2017 mSDtfsCounter, 0 mSDsluCounter, 4024 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6041 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:47,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6041 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-12 00:56:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-11-12 00:56:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1351 states have (on average 1.4974093264248705) internal successors, (2023), 1351 states have internal predecessors, (2023), 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-12 00:56:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2023 transitions. [2024-11-12 00:56:47,349 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2023 transitions. Word has length 48 [2024-11-12 00:56:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:47,349 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2023 transitions. [2024-11-12 00:56:47,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2023 transitions. [2024-11-12 00:56:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:56:47,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:47,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:47,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:56:47,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:47,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash 17506197, now seen corresponding path program 1 times [2024-11-12 00:56:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:47,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109400879] [2024-11-12 00:56:47,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:47,820 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-12 00:56:47,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:47,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109400879] [2024-11-12 00:56:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109400879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:47,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781823058] [2024-11-12 00:56:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:47,824 INFO L87 Difference]: Start difference. First operand 1352 states and 2023 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:47,982 INFO L93 Difference]: Finished difference Result 2884 states and 4313 transitions. [2024-11-12 00:56:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 00:56:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:47,988 INFO L225 Difference]: With dead ends: 2884 [2024-11-12 00:56:47,989 INFO L226 Difference]: Without dead ends: 1586 [2024-11-12 00:56:47,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 00:56:47,995 INFO L435 NwaCegarLoop]: 2006 mSDtfsCounter, 2673 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 6018 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:47,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 6018 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-12 00:56:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1362. [2024-11-12 00:56:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.49669360764144) internal successors, (2037), 1361 states have internal predecessors, (2037), 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-12 00:56:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2037 transitions. [2024-11-12 00:56:48,027 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2037 transitions. Word has length 49 [2024-11-12 00:56:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:48,027 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2037 transitions. [2024-11-12 00:56:48,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2037 transitions. [2024-11-12 00:56:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:56:48,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:48,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:48,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:56:48,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:48,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash -379362750, now seen corresponding path program 1 times [2024-11-12 00:56:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:48,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596686740] [2024-11-12 00:56:48,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:48,435 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-12 00:56:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596686740] [2024-11-12 00:56:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596686740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099326303] [2024-11-12 00:56:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:48,439 INFO L87 Difference]: Start difference. First operand 1362 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:48,540 INFO L93 Difference]: Finished difference Result 2678 states and 4006 transitions. [2024-11-12 00:56:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:56:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-12 00:56:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:48,546 INFO L225 Difference]: With dead ends: 2678 [2024-11-12 00:56:48,546 INFO L226 Difference]: Without dead ends: 1380 [2024-11-12 00:56:48,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:48,550 INFO L435 NwaCegarLoop]: 2015 mSDtfsCounter, 12 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10059 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:48,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10059 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-12 00:56:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-12 00:56:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.4949127906976745) internal successors, (2057), 1376 states have internal predecessors, (2057), 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-12 00:56:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2057 transitions. [2024-11-12 00:56:48,577 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2057 transitions. Word has length 50 [2024-11-12 00:56:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:48,577 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2057 transitions. [2024-11-12 00:56:48,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2057 transitions. [2024-11-12 00:56:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:56:48,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:48,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:48,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:56:48,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1826125966, now seen corresponding path program 1 times [2024-11-12 00:56:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426146414] [2024-11-12 00:56:48,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:48,916 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-12 00:56:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426146414] [2024-11-12 00:56:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426146414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724843367] [2024-11-12 00:56:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:48,918 INFO L87 Difference]: Start difference. First operand 1377 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:49,016 INFO L93 Difference]: Finished difference Result 2696 states and 4029 transitions. [2024-11-12 00:56:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-12 00:56:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:49,023 INFO L225 Difference]: With dead ends: 2696 [2024-11-12 00:56:49,023 INFO L226 Difference]: Without dead ends: 1381 [2024-11-12 00:56:49,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:49,027 INFO L435 NwaCegarLoop]: 2014 mSDtfsCounter, 1991 mSDsluCounter, 4019 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:49,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 6033 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-12 00:56:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2024-11-12 00:56:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1380 states have (on average 1.4934782608695651) internal successors, (2061), 1380 states have internal predecessors, (2061), 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-12 00:56:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2061 transitions. [2024-11-12 00:56:49,055 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2061 transitions. Word has length 51 [2024-11-12 00:56:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:49,057 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2061 transitions. [2024-11-12 00:56:49,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2061 transitions. [2024-11-12 00:56:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:56:49,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:49,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:49,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:56:49,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2033543712, now seen corresponding path program 1 times [2024-11-12 00:56:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585695438] [2024-11-12 00:56:49,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:49,391 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-12 00:56:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585695438] [2024-11-12 00:56:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585695438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:56:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869824495] [2024-11-12 00:56:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:49,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:56:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:56:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:49,394 INFO L87 Difference]: Start difference. First operand 1381 states and 2061 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:49,515 INFO L93 Difference]: Finished difference Result 2702 states and 4036 transitions. [2024-11-12 00:56:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:56:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-12 00:56:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:49,521 INFO L225 Difference]: With dead ends: 2702 [2024-11-12 00:56:49,521 INFO L226 Difference]: Without dead ends: 1389 [2024-11-12 00:56:49,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:49,524 INFO L435 NwaCegarLoop]: 2011 mSDtfsCounter, 12 mSDsluCounter, 10040 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12051 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:49,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12051 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-12 00:56:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1388. [2024-11-12 00:56:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1387 states have (on average 1.4931506849315068) internal successors, (2071), 1387 states have internal predecessors, (2071), 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-12 00:56:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2071 transitions. [2024-11-12 00:56:49,552 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2071 transitions. Word has length 51 [2024-11-12 00:56:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:49,553 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2071 transitions. [2024-11-12 00:56:49,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2071 transitions. [2024-11-12 00:56:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 00:56:49,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:49,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:49,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:56:49,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:49,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2035892791, now seen corresponding path program 1 times [2024-11-12 00:56:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945479803] [2024-11-12 00:56:49,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:50,004 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-12 00:56:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:50,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945479803] [2024-11-12 00:56:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945479803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:50,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:56:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079238729] [2024-11-12 00:56:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:50,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:56:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:56:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:50,007 INFO L87 Difference]: Start difference. First operand 1388 states and 2071 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:50,117 INFO L93 Difference]: Finished difference Result 2711 states and 4049 transitions. [2024-11-12 00:56:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:56:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-12 00:56:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:50,124 INFO L225 Difference]: With dead ends: 2711 [2024-11-12 00:56:50,125 INFO L226 Difference]: Without dead ends: 1391 [2024-11-12 00:56:50,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:50,129 INFO L435 NwaCegarLoop]: 2010 mSDtfsCounter, 13 mSDsluCounter, 8026 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10036 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:50,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10036 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-11-12 00:56:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2024-11-12 00:56:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 1.492086330935252) internal successors, (2074), 1390 states have internal predecessors, (2074), 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-12 00:56:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2074 transitions. [2024-11-12 00:56:50,164 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2074 transitions. Word has length 52 [2024-11-12 00:56:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:50,165 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 2074 transitions. [2024-11-12 00:56:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2074 transitions. [2024-11-12 00:56:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 00:56:50,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:50,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:50,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:56:50,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 524993220, now seen corresponding path program 1 times [2024-11-12 00:56:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703448434] [2024-11-12 00:56:50,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:50,517 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-12 00:56:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703448434] [2024-11-12 00:56:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703448434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427902917] [2024-11-12 00:56:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:50,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:50,520 INFO L87 Difference]: Start difference. First operand 1391 states and 2074 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:50,642 INFO L93 Difference]: Finished difference Result 2957 states and 4408 transitions. [2024-11-12 00:56:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-12 00:56:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:50,648 INFO L225 Difference]: With dead ends: 2957 [2024-11-12 00:56:50,648 INFO L226 Difference]: Without dead ends: 1634 [2024-11-12 00:56:50,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 00:56:50,651 INFO L435 NwaCegarLoop]: 2008 mSDtfsCounter, 2663 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 6020 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:50,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 6020 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-12 00:56:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1401. [2024-11-12 00:56:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.49) internal successors, (2086), 1400 states have internal predecessors, (2086), 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-12 00:56:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2086 transitions. [2024-11-12 00:56:50,679 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2086 transitions. Word has length 53 [2024-11-12 00:56:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:50,680 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2086 transitions. [2024-11-12 00:56:50,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2086 transitions. [2024-11-12 00:56:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:56:50,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:50,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:50,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:56:50,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1718805400, now seen corresponding path program 1 times [2024-11-12 00:56:50,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:50,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931136733] [2024-11-12 00:56:50,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:50,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:51,240 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-12 00:56:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931136733] [2024-11-12 00:56:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931136733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:51,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 00:56:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115991023] [2024-11-12 00:56:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:56:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:56:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:56:51,243 INFO L87 Difference]: Start difference. First operand 1401 states and 2086 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:51,491 INFO L93 Difference]: Finished difference Result 2731 states and 4071 transitions. [2024-11-12 00:56:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:56:51,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-12 00:56:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:51,497 INFO L225 Difference]: With dead ends: 2731 [2024-11-12 00:56:51,498 INFO L226 Difference]: Without dead ends: 1408 [2024-11-12 00:56:51,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:56:51,501 INFO L435 NwaCegarLoop]: 2005 mSDtfsCounter, 2016 mSDsluCounter, 12014 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 14019 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 14019 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-12 00:56:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1405. [2024-11-12 00:56:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4893162393162394) internal successors, (2091), 1404 states have internal predecessors, (2091), 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-12 00:56:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2091 transitions. [2024-11-12 00:56:51,533 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2091 transitions. Word has length 54 [2024-11-12 00:56:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:51,534 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2091 transitions. [2024-11-12 00:56:51,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2091 transitions. [2024-11-12 00:56:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:56:51,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:51,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:51,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:56:51,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:51,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 967984571, now seen corresponding path program 1 times [2024-11-12 00:56:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:51,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220893311] [2024-11-12 00:56:51,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:51,933 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-12 00:56:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220893311] [2024-11-12 00:56:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220893311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700065260] [2024-11-12 00:56:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:51,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:51,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:51,936 INFO L87 Difference]: Start difference. First operand 1405 states and 2091 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:52,098 INFO L93 Difference]: Finished difference Result 2756 states and 4104 transitions. [2024-11-12 00:56:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-12 00:56:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:52,104 INFO L225 Difference]: With dead ends: 2756 [2024-11-12 00:56:52,105 INFO L226 Difference]: Without dead ends: 1429 [2024-11-12 00:56:52,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:52,107 INFO L435 NwaCegarLoop]: 2010 mSDtfsCounter, 6 mSDsluCounter, 10034 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12044 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:52,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12044 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-12 00:56:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1421. [2024-11-12 00:56:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.486619718309859) internal successors, (2111), 1420 states have internal predecessors, (2111), 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-12 00:56:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2111 transitions. [2024-11-12 00:56:52,141 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2111 transitions. Word has length 54 [2024-11-12 00:56:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:52,142 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2111 transitions. [2024-11-12 00:56:52,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2111 transitions. [2024-11-12 00:56:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:56:52,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:52,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:56:52,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1113154690, now seen corresponding path program 1 times [2024-11-12 00:56:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509645861] [2024-11-12 00:56:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:52,612 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-12 00:56:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509645861] [2024-11-12 00:56:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509645861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123235746] [2024-11-12 00:56:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:52,615 INFO L87 Difference]: Start difference. First operand 1421 states and 2111 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:52,836 INFO L93 Difference]: Finished difference Result 3077 states and 4570 transitions. [2024-11-12 00:56:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:56:52,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-12 00:56:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:52,843 INFO L225 Difference]: With dead ends: 3077 [2024-11-12 00:56:52,843 INFO L226 Difference]: Without dead ends: 1730 [2024-11-12 00:56:52,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:56:52,846 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 2870 mSDsluCounter, 4000 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 6000 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:52,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 6000 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-11-12 00:56:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1421. [2024-11-12 00:56:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4859154929577465) internal successors, (2110), 1420 states have internal predecessors, (2110), 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-12 00:56:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2110 transitions. [2024-11-12 00:56:52,873 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2110 transitions. Word has length 54 [2024-11-12 00:56:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2110 transitions. [2024-11-12 00:56:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2110 transitions. [2024-11-12 00:56:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 00:56:52,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:52,875 INFO L218 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] [2024-11-12 00:56:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:56:52,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -987062074, now seen corresponding path program 1 times [2024-11-12 00:56:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009899213] [2024-11-12 00:56:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:53,509 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-12 00:56:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:53,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009899213] [2024-11-12 00:56:53,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009899213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:53,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 00:56:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777194566] [2024-11-12 00:56:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:53,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 00:56:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 00:56:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:53,511 INFO L87 Difference]: Start difference. First operand 1421 states and 2110 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-12 00:56:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:53,878 INFO L93 Difference]: Finished difference Result 3003 states and 4462 transitions. [2024-11-12 00:56:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:56:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 55 [2024-11-12 00:56:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:53,885 INFO L225 Difference]: With dead ends: 3003 [2024-11-12 00:56:53,886 INFO L226 Difference]: Without dead ends: 1666 [2024-11-12 00:56:53,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-12 00:56:53,889 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 2695 mSDsluCounter, 15984 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 17984 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:53,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 17984 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-12 00:56:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1426. [2024-11-12 00:56:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.4849122807017543) internal successors, (2116), 1425 states have internal predecessors, (2116), 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-12 00:56:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2116 transitions. [2024-11-12 00:56:53,919 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2116 transitions. Word has length 55 [2024-11-12 00:56:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 2116 transitions. [2024-11-12 00:56:53,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-12 00:56:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2116 transitions. [2024-11-12 00:56:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 00:56:53,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:53,921 INFO L218 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] [2024-11-12 00:56:53,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:56:53,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:53,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1783268771, now seen corresponding path program 1 times [2024-11-12 00:56:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158123563] [2024-11-12 00:56:53,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:54,228 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-12 00:56:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158123563] [2024-11-12 00:56:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158123563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539737943] [2024-11-12 00:56:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:54,232 INFO L87 Difference]: Start difference. First operand 1426 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 00:56:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:54,419 INFO L93 Difference]: Finished difference Result 3054 states and 4540 transitions. [2024-11-12 00:56:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2024-11-12 00:56:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:54,426 INFO L225 Difference]: With dead ends: 3054 [2024-11-12 00:56:54,426 INFO L226 Difference]: Without dead ends: 1705 [2024-11-12 00:56:54,428 INFO L434 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-12 00:56:54,429 INFO L435 NwaCegarLoop]: 2003 mSDtfsCounter, 2860 mSDsluCounter, 4000 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 6003 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:54,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 6003 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-12 00:56:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1412. [2024-11-12 00:56:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.48830616583983) internal successors, (2100), 1411 states have internal predecessors, (2100), 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-12 00:56:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2100 transitions. [2024-11-12 00:56:54,457 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2100 transitions. Word has length 55 [2024-11-12 00:56:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:54,457 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2100 transitions. [2024-11-12 00:56:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 00:56:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2100 transitions. [2024-11-12 00:56:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 00:56:54,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:54,458 INFO L218 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] [2024-11-12 00:56:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:56:54,459 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 655322582, now seen corresponding path program 1 times [2024-11-12 00:56:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512172787] [2024-11-12 00:56:54,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:54,788 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-12 00:56:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512172787] [2024-11-12 00:56:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512172787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391092295] [2024-11-12 00:56:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:54,790 INFO L87 Difference]: Start difference. First operand 1412 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-12 00:56:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:54,927 INFO L93 Difference]: Finished difference Result 2896 states and 4308 transitions. [2024-11-12 00:56:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-12 00:56:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:54,933 INFO L225 Difference]: With dead ends: 2896 [2024-11-12 00:56:54,933 INFO L226 Difference]: Without dead ends: 1551 [2024-11-12 00:56:54,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:54,935 INFO L435 NwaCegarLoop]: 2003 mSDtfsCounter, 2207 mSDsluCounter, 4004 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 6007 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:54,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 6007 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:56:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-12 00:56:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1404. [2024-11-12 00:56:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.489665003563792) internal successors, (2090), 1403 states have internal predecessors, (2090), 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-12 00:56:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2090 transitions. [2024-11-12 00:56:54,959 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2090 transitions. Word has length 56 [2024-11-12 00:56:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2090 transitions. [2024-11-12 00:56:54,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-12 00:56:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2090 transitions. [2024-11-12 00:56:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 00:56:54,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:54,960 INFO L218 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] [2024-11-12 00:56:54,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:56:54,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1277840950, now seen corresponding path program 1 times [2024-11-12 00:56:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473072602] [2024-11-12 00:56:54,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:55,637 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-12 00:56:55,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:55,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473072602] [2024-11-12 00:56:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473072602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:55,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 00:56:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472411316] [2024-11-12 00:56:55,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:55,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 00:56:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 00:56:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:56:55,640 INFO L87 Difference]: Start difference. First operand 1404 states and 2090 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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-12 00:56:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:56,078 INFO L93 Difference]: Finished difference Result 2967 states and 4417 transitions. [2024-11-12 00:56:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 00:56:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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 56 [2024-11-12 00:56:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:56,085 INFO L225 Difference]: With dead ends: 2967 [2024-11-12 00:56:56,086 INFO L226 Difference]: Without dead ends: 1630 [2024-11-12 00:56:56,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-12 00:56:56,088 INFO L435 NwaCegarLoop]: 1997 mSDtfsCounter, 2664 mSDsluCounter, 17958 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 19955 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:56,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 19955 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-11-12 00:56:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1409. [2024-11-12 00:56:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4900568181818181) internal successors, (2098), 1408 states have internal predecessors, (2098), 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-12 00:56:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2098 transitions. [2024-11-12 00:56:56,123 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2098 transitions. Word has length 56 [2024-11-12 00:56:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:56,123 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2098 transitions. [2024-11-12 00:56:56,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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-12 00:56:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2098 transitions. [2024-11-12 00:56:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 00:56:56,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:56,124 INFO L218 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] [2024-11-12 00:56:56,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:56:56,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:56,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2147127706, now seen corresponding path program 1 times [2024-11-12 00:56:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536421324] [2024-11-12 00:56:56,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:56:56,190 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:56:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:56:56,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:56:56,317 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:56:56,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:56:56,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 00:56:56,322 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:56,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:56:56,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:56:56 BoogieIcfgContainer [2024-11-12 00:56:56,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:56:56,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:56:56,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:56:56,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:56:56,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:45" (3/4) ... [2024-11-12 00:56:56,414 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:56:56,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:56:56,416 INFO L158 Benchmark]: Toolchain (without parser) took 17989.42ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 118.5MB in the beginning and 920.6MB in the end (delta: -802.1MB). Peak memory consumption was 255.7MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,416 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:56:56,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 986.76ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 105.7MB in the end (delta: 12.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 580.50ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 105.7MB in the beginning and 112.8MB in the end (delta: -7.2MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,417 INFO L158 Benchmark]: Boogie Preprocessor took 861.58ms. Allocated memory is still 232.8MB. Free memory was 112.8MB in the beginning and 84.4MB in the end (delta: 28.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,417 INFO L158 Benchmark]: RCFGBuilder took 5001.61ms. Allocated memory was 232.8MB in the beginning and 757.1MB in the end (delta: 524.3MB). Free memory was 84.4MB in the beginning and 576.8MB in the end (delta: -492.4MB). Peak memory consumption was 377.5MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,418 INFO L158 Benchmark]: TraceAbstraction took 10545.82ms. Allocated memory was 757.1MB in the beginning and 1.2GB in the end (delta: 457.2MB). Free memory was 575.8MB in the beginning and 920.6MB in the end (delta: -344.9MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2024-11-12 00:56:56,418 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 1.2GB. Free memory is still 920.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:56:56,422 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.22ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 986.76ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 105.7MB in the end (delta: 12.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 580.50ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 105.7MB in the beginning and 112.8MB in the end (delta: -7.2MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 861.58ms. Allocated memory is still 232.8MB. Free memory was 112.8MB in the beginning and 84.4MB in the end (delta: 28.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * RCFGBuilder took 5001.61ms. Allocated memory was 232.8MB in the beginning and 757.1MB in the end (delta: 524.3MB). Free memory was 84.4MB in the beginning and 576.8MB in the end (delta: -492.4MB). Peak memory consumption was 377.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10545.82ms. Allocated memory was 757.1MB in the beginning and 1.2GB in the end (delta: 457.2MB). Free memory was 575.8MB in the beginning and 920.6MB in the end (delta: -344.9MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. * Witness Printer took 5.58ms. Allocated memory is still 1.2GB. Free memory is still 920.6MB. 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 bitwiseOr at line 215, overapproximation of bitwiseAnd at line 220. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 12); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (12 - 1); [L38] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 17); [L39] const SORT_98 msb_SORT_98 = (SORT_98)1 << (17 - 1); [L41] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 5); [L42] const SORT_99 msb_SORT_99 = (SORT_99)1 << (5 - 1); [L44] const SORT_102 mask_SORT_102 = (SORT_102)-1 >> (sizeof(SORT_102) * 8 - 9); [L45] const SORT_102 msb_SORT_102 = (SORT_102)1 << (9 - 1); [L47] const SORT_104 mask_SORT_104 = (SORT_104)-1 >> (sizeof(SORT_104) * 8 - 10); [L48] const SORT_104 msb_SORT_104 = (SORT_104)1 << (10 - 1); [L50] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 11); [L51] const SORT_107 msb_SORT_107 = (SORT_107)1 << (11 - 1); [L53] const SORT_112 mask_SORT_112 = (SORT_112)-1 >> (sizeof(SORT_112) * 8 - 13); [L54] const SORT_112 msb_SORT_112 = (SORT_112)1 << (13 - 1); [L56] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 14); [L57] const SORT_115 msb_SORT_115 = (SORT_115)1 << (14 - 1); [L59] const SORT_118 mask_SORT_118 = (SORT_118)-1 >> (sizeof(SORT_118) * 8 - 15); [L60] const SORT_118 msb_SORT_118 = (SORT_118)1 << (15 - 1); [L62] const SORT_151 mask_SORT_151 = (SORT_151)-1 >> (sizeof(SORT_151) * 8 - 7); [L63] const SORT_151 msb_SORT_151 = (SORT_151)1 << (7 - 1); [L65] const SORT_211 mask_SORT_211 = (SORT_211)-1 >> (sizeof(SORT_211) * 8 - 2); [L66] const SORT_211 msb_SORT_211 = (SORT_211)1 << (2 - 1); [L68] const SORT_370 mask_SORT_370 = (SORT_370)-1 >> (sizeof(SORT_370) * 8 - 4); [L69] const SORT_370 msb_SORT_370 = (SORT_370)1 << (4 - 1); [L71] const SORT_373 mask_SORT_373 = (SORT_373)-1 >> (sizeof(SORT_373) * 8 - 6); [L72] const SORT_373 msb_SORT_373 = (SORT_373)1 << (6 - 1); [L74] const SORT_376 mask_SORT_376 = (SORT_376)-1 >> (sizeof(SORT_376) * 8 - 8); [L75] const SORT_376 msb_SORT_376 = (SORT_376)1 << (8 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_9 var_11 = 2; [L79] const SORT_9 var_13 = 0; [L80] const SORT_1 var_19 = 0; [L81] const SORT_1 var_34 = 1; [L82] const SORT_44 var_45 = 0; [L83] const SORT_9 var_61 = 1; [L84] const SORT_9 var_66 = 4; [L85] const SORT_9 var_68 = 5; [L86] const SORT_9 var_72 = 3; [L87] const SORT_99 var_100 = 0; [L88] const SORT_151 var_153 = 5; [L89] const SORT_151 var_157 = 4; [L90] const SORT_151 var_161 = 3; [L91] const SORT_151 var_165 = 2; [L92] const SORT_151 var_169 = 1; [L93] const SORT_151 var_173 = 0; [L94] const SORT_44 var_196 = 2; [L95] const SORT_211 var_213 = 0; [L96] const SORT_3 var_220 = 65535; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_208; [L102] SORT_3 input_209; [L103] SORT_3 input_210; [L104] SORT_3 input_219; [L105] SORT_3 input_228; [L106] SORT_3 input_229; [L107] SORT_3 input_230; [L108] SORT_3 input_233; [L109] SORT_3 input_251; [L110] SORT_3 input_252; [L111] SORT_3 input_253; [L112] SORT_3 input_256; [L113] SORT_3 input_258; [L114] SORT_211 input_272; [L115] SORT_211 input_273; [L116] SORT_211 input_274; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L119] SORT_9 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L120] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L121] SORT_3 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L122] SORT_3 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L123] SORT_3 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L124] SORT_3 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L125] SORT_44 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L126] SORT_44 state_48 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L127] SORT_3 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L128] SORT_3 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L129] SORT_3 state_54 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L130] SORT_3 state_56 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_9 init_15_arg_1 = var_13; [L135] state_14 = init_15_arg_1 [L136] SORT_1 init_21_arg_1 = var_19; [L137] state_20 = init_21_arg_1 [L138] SORT_3 init_24_arg_1 = var_6; [L139] state_23 = init_24_arg_1 [L140] SORT_3 init_39_arg_1 = var_6; [L141] state_38 = init_39_arg_1 [L142] SORT_3 init_41_arg_1 = var_6; [L143] state_40 = init_41_arg_1 [L144] SORT_3 init_43_arg_1 = var_6; [L145] state_42 = init_43_arg_1 [L146] SORT_44 init_47_arg_1 = var_45; [L147] state_46 = init_47_arg_1 [L148] SORT_44 init_49_arg_1 = var_45; [L149] state_48 = init_49_arg_1 [L150] SORT_3 init_51_arg_1 = var_6; [L151] state_50 = init_51_arg_1 [L152] SORT_3 init_53_arg_1 = var_6; [L153] state_52 = init_53_arg_1 [L154] SORT_3 init_55_arg_1 = var_6; [L155] state_54 = init_55_arg_1 [L156] SORT_3 init_57_arg_1 = var_6; [L157] state_56 = init_57_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_208 = __VERIFIER_nondet_ushort() [L164] input_209 = __VERIFIER_nondet_ushort() [L165] input_210 = __VERIFIER_nondet_ushort() [L166] input_219 = __VERIFIER_nondet_ushort() [L167] input_228 = __VERIFIER_nondet_ushort() [L168] input_229 = __VERIFIER_nondet_ushort() [L169] input_230 = __VERIFIER_nondet_ushort() [L170] input_233 = __VERIFIER_nondet_ushort() [L171] input_251 = __VERIFIER_nondet_ushort() [L172] input_252 = __VERIFIER_nondet_ushort() [L173] input_253 = __VERIFIER_nondet_ushort() [L174] input_256 = __VERIFIER_nondet_ushort() [L175] input_258 = __VERIFIER_nondet_ushort() [L176] input_272 = __VERIFIER_nondet_uchar() [L177] input_273 = __VERIFIER_nondet_uchar() [L178] input_274 = __VERIFIER_nondet_uchar() [L181] SORT_3 var_10_arg_0 = state_7; [L182] SORT_9 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] EXPR var_10 & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] var_10 = var_10 & mask_SORT_9 [L184] SORT_9 var_12_arg_0 = var_10; [L185] SORT_9 var_12_arg_1 = var_11; [L186] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L187] SORT_9 var_16_arg_0 = state_14; [L188] SORT_1 var_16 = var_16_arg_0 >> 2; [L189] SORT_1 var_17_arg_0 = var_12; [L190] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_17_arg_0=0, var_17_arg_1=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L192] SORT_1 var_18_arg_0 = var_17; [L193] SORT_1 var_18 = ~var_18_arg_0; [L194] SORT_1 var_22_arg_0 = state_20; [L195] SORT_1 var_22 = ~var_22_arg_0; [L196] SORT_3 var_25_arg_0 = state_23; [L197] SORT_3 var_25_arg_1 = var_6; [L198] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L199] SORT_1 var_26_arg_0 = var_22; [L200] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26_arg_0=-1, var_26_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L202] SORT_3 var_27_arg_0 = state_23; [L203] SORT_3 var_27_arg_1 = var_6; [L204] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L205] SORT_1 var_28_arg_0 = var_27; [L206] SORT_1 var_28 = ~var_28_arg_0; [L207] SORT_1 var_29_arg_0 = var_28; [L208] SORT_1 var_29_arg_1 = state_20; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_29_arg_0=-2, var_29_arg_1=0, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] EXPR var_29_arg_0 | var_29_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] SORT_1 var_29 = var_29_arg_0 | var_29_arg_1; [L210] SORT_1 var_30_arg_0 = var_26; [L211] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_30_arg_0=255, var_30_arg_1=254, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L213] SORT_1 var_31_arg_0 = var_18; [L214] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_31_arg_0=-1, var_31_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L216] SORT_1 var_35_arg_0 = var_31; [L217] SORT_1 var_35 = ~var_35_arg_0; [L218] SORT_1 var_36_arg_0 = var_34; [L219] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_36_arg_0=1, var_36_arg_1=-1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] EXPR var_36_arg_0 & var_36_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L221] EXPR var_36 & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L221] var_36 = var_36 & mask_SORT_1 [L222] SORT_1 bad_37_arg_0 = var_36; [L223] CALL __VERIFIER_assert(!(bad_37_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1351 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22682 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22682 mSDsluCounter, 144315 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114199 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 30116 mSDtfsCounter, 1058 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1426occurred 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.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1682 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 2211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-12 00:56:56,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:56:58,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:56:58,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:56:58,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:56:58,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:56:58,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:56:58,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:56:58,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:56:58,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:56:58,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:56:58,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:56:58,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:56:58,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:56:58,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:56:58,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:56:58,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:56:58,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:56:58,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:56:58,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:56:58,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:56:58,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:56:58,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:56:58,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:56:58,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:56:58,940 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:56:58,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:56:58,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:56:58,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:56:58,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:56:58,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:56:58,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:56:58,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:58,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:56:58,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:56:58,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:56:58,943 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:56:58,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:56:58,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:56:58,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:56:58,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:56:58,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:56:58,945 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2024-11-12 00:56:59,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:56:59,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:56:59,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:56:59,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:56:59,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:56:59,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:57:00,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:01,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:01,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:57:01,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb63dc40/c16bb23b5c7148cf9d47060995ac4302/FLAG7b8a3224d [2024-11-12 00:57:01,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb63dc40/c16bb23b5c7148cf9d47060995ac4302 [2024-11-12 00:57:01,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:01,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:01,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:01,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:01,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:01,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63033b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01, skipping insertion in model container [2024-11-12 00:57:01,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:01,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-11-12 00:57:02,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:02,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:02,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-11-12 00:57:02,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:02,222 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:02,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02 WrapperNode [2024-11-12 00:57:02,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:02,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:02,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:02,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:02,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,393 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1833 [2024-11-12 00:57:02,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:02,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:02,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:02,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:02,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:57:02,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:02,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:02,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:02,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:02,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (1/1) ... [2024-11-12 00:57:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:02,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:02,636 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-12 00:57:02,639 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-12 00:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:02,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:03,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:03,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:05,911 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:05,911 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:05,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:05,924 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:05,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:05 BoogieIcfgContainer [2024-11-12 00:57:05,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:05,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:05,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:05,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:01" (1/3) ... [2024-11-12 00:57:05,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:05, skipping insertion in model container [2024-11-12 00:57:05,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:02" (2/3) ... [2024-11-12 00:57:05,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:05, skipping insertion in model container [2024-11-12 00:57:05,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:05" (3/3) ... [2024-11-12 00:57:05,935 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-11-12 00:57:05,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:05,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:06,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:06,012 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;@5b688d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:06,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-12 00:57:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:57:06,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:06,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:57:06,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:57:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024182819] [2024-11-12 00:57:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:06,046 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-12 00:57:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:06,049 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-12 00:57:06,068 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-12 00:57:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:06,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 00:57:06,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:06,695 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-12 00:57:06,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:57:06,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:06,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024182819] [2024-11-12 00:57:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024182819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645644328] [2024-11-12 00:57:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:06,729 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-12 00:57:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:06,860 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:57:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-12 00:57:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:06,869 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:57:06,870 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:57:06,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:06,877 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:06,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:57:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:57:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-12 00:57:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:57:06,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:57:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:06,905 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:57:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-12 00:57:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:57:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:57:06,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:06,906 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:06,913 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-12 00:57:07,107 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-12 00:57:07,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:57:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:07,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66023730] [2024-11-12 00:57:07,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:07,110 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-12 00:57:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:07,112 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-12 00:57:07,115 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-12 00:57:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:07,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 00:57:07,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:08,012 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-12 00:57:08,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:57:08,253 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-12 00:57:08,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66023730] [2024-11-12 00:57:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66023730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:57:08,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:57:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:57:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834391803] [2024-11-12 00:57:08,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:57:08,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:57:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:57:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:08,258 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-12 00:57:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:08,739 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-12 00:57:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:57:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-12 00:57:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:08,741 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:57:08,741 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 00:57:08,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:57:08,742 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:08,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:57:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 00:57:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-12 00:57:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-12 00:57:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-12 00:57:08,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-12 00:57:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 00:57:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-12 00:57:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-12 00:57:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 00:57:08,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:08,748 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-12 00:57:08,758 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 00:57:08,949 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-12 00:57:08,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:08,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-12 00:57:08,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070328058] [2024-11-12 00:57:08,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:57:08,953 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-12 00:57:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:08,957 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-12 00:57:08,958 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-12 00:57:10,696 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:57:10,696 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:57:10,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 00:57:10,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:11,076 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-12 00:57:11,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:57:12,207 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-12 00:57:12,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070328058] [2024-11-12 00:57:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070328058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:57:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:57:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 00:57:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089079197] [2024-11-12 00:57:12,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:57:12,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 00:57:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 00:57:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:57:12,210 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-12 00:57:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:13,773 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-12 00:57:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 00:57:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2024-11-12 00:57:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:13,774 INFO L225 Difference]: With dead ends: 32 [2024-11-12 00:57:13,775 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 00:57:13,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-12 00:57:13,777 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:13,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 00:57:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 00:57:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-11-12 00:57:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-12 00:57:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-12 00:57:13,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2024-11-12 00:57:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:13,794 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-12 00:57:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-12 00:57:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-12 00:57:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 00:57:13,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:13,795 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-12 00:57:13,813 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 (4)] Ended with exit code 0 [2024-11-12 00:57:13,996 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-12 00:57:13,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-12 00:57:13,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709360271] [2024-11-12 00:57:13,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 00:57:13,999 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-12 00:57:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:14,002 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-12 00:57:14,003 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-12 00:57:16,869 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-12 00:57:16,869 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:57:16,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-12 00:57:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:40,386 INFO L312 TraceCheckSpWp]: Computing backward predicates...