./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 07:03:03,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:03,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:03:03,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:03,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:03,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:03,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:03,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:03,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:03,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:03,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:03,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:03,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:03,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:03,124 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:03,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:03,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:03,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:03:03,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:03,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:03,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:03,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:03,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:03,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:03,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:03,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:03,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:03,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:03,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:03,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:03,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:03,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:03,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:03,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:03:03,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:03:03,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:03,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:03,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:03,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:03,132 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-clean/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-clean/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-10-11 07:03:03,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:03,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:03,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:03,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:03,470 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:03,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:04,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:05,334 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:05,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:05,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a60945f4/00ddc3d1b9504f55b1c2d650ea36d6a2/FLAGc29764d31 [2024-10-11 07:03:05,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a60945f4/00ddc3d1b9504f55b1c2d650ea36d6a2 [2024-10-11 07:03:05,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:05,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:05,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:05,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:05,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:05,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:05" (1/1) ... [2024-10-11 07:03:05,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0d8e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:05, skipping insertion in model container [2024-10-11 07:03:05,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:05" (1/1) ... [2024-10-11 07:03:05,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:05,906 WARN L248 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-10-11 07:03:06,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:06,263 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:06,273 WARN L248 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-10-11 07:03:06,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:06,481 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:06,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06 WrapperNode [2024-10-11 07:03:06,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:06,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:06,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:06,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:06,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:06,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,250 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4515 [2024-10-11 07:03:07,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:07,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:07,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:07,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:07,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,628 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-10-11 07:03:07,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:07,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:08,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:08,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:08,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:08,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:08,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (1/1) ... [2024-10-11 07:03:08,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:08,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:08,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:03:08,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:03:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:03:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:08,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:08,642 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:08,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:12,962 INFO L? ?]: Removed 2689 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:12,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:13,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:13,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:13,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:13 BoogieIcfgContainer [2024-10-11 07:03:13,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:13,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:13,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:13,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:13,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:05" (1/3) ... [2024-10-11 07:03:13,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2508adfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:13, skipping insertion in model container [2024-10-11 07:03:13,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:06" (2/3) ... [2024-10-11 07:03:13,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2508adfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:13, skipping insertion in model container [2024-10-11 07:03:13,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:13" (3/3) ... [2024-10-11 07:03:13,096 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:13,113 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:13,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:13,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:13,220 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;@2cce1f78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:13,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 1348 states, 1346 states have (on average 1.50074294205052) internal successors, (2020), 1347 states have internal predecessors, (2020), 0 states have call successors, (0), 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-10-11 07:03:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 07:03:13,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:13,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:13,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1557405312, now seen corresponding path program 1 times [2024-10-11 07:03:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289343186] [2024-10-11 07:03:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289343186] [2024-10-11 07:03:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289343186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446641715] [2024-10-11 07:03:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:14,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:14,121 INFO L87 Difference]: Start difference. First operand has 1348 states, 1346 states have (on average 1.50074294205052) internal successors, (2020), 1347 states have internal predecessors, (2020), 0 states have call successors, (0), 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.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-11 07:03:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:14,280 INFO L93 Difference]: Finished difference Result 2644 states and 3964 transitions. [2024-10-11 07:03:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 07:03:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:14,309 INFO L225 Difference]: With dead ends: 2644 [2024-10-11 07:03:14,309 INFO L226 Difference]: Without dead ends: 1349 [2024-10-11 07:03:14,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:14,324 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 0 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6040 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:14,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6040 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-10-11 07:03:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2024-10-11 07:03:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4985163204747773) internal successors, (2020), 1348 states have internal predecessors, (2020), 0 states have call successors, (0), 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-10-11 07:03:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2020 transitions. [2024-10-11 07:03:14,449 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2020 transitions. Word has length 46 [2024-10-11 07:03:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:14,450 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2020 transitions. [2024-10-11 07:03:14,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-11 07:03:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2020 transitions. [2024-10-11 07:03:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 07:03:14,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:14,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:03:14,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:14,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1033228990, now seen corresponding path program 1 times [2024-10-11 07:03:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31259094] [2024-10-11 07:03:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31259094] [2024-10-11 07:03:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31259094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:14,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:14,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795310900] [2024-10-11 07:03:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:14,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:14,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:14,664 INFO L87 Difference]: Start difference. First operand 1349 states and 2020 transitions. 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-10-11 07:03:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:14,729 INFO L93 Difference]: Finished difference Result 2647 states and 3964 transitions. [2024-10-11 07:03:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:14,730 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-10-11 07:03:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:14,736 INFO L225 Difference]: With dead ends: 2647 [2024-10-11 07:03:14,736 INFO L226 Difference]: Without dead ends: 1351 [2024-10-11 07:03:14,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:14,739 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 0 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6037 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:14,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6037 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-10-11 07:03:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2024-10-11 07:03:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4977777777777779) internal successors, (2022), 1350 states have internal predecessors, (2022), 0 states have call successors, (0), 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-10-11 07:03:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2022 transitions. [2024-10-11 07:03:14,768 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2022 transitions. Word has length 47 [2024-10-11 07:03:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:14,769 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2022 transitions. [2024-10-11 07:03:14,769 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-10-11 07:03:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2022 transitions. [2024-10-11 07:03:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 07:03:14,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:14,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:14,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:03:14,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:14,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1231674009, now seen corresponding path program 1 times [2024-10-11 07:03:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031713866] [2024-10-11 07:03:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031713866] [2024-10-11 07:03:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031713866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:15,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138834676] [2024-10-11 07:03:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:15,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:15,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:15,198 INFO L87 Difference]: Start difference. First operand 1351 states and 2022 transitions. Second operand has 5 states, 5 states have (on average 9.6) 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-10-11 07:03:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:15,359 INFO L93 Difference]: Finished difference Result 2883 states and 4312 transitions. [2024-10-11 07:03:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) 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-10-11 07:03:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:15,366 INFO L225 Difference]: With dead ends: 2883 [2024-10-11 07:03:15,366 INFO L226 Difference]: Without dead ends: 1585 [2024-10-11 07:03:15,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 07:03:15,370 INFO L432 NwaCegarLoop]: 2004 mSDtfsCounter, 2673 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 6013 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:15,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 6013 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-10-11 07:03:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1361. [2024-10-11 07:03:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4970588235294118) internal successors, (2036), 1360 states have internal predecessors, (2036), 0 states have call successors, (0), 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-10-11 07:03:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2036 transitions. [2024-10-11 07:03:15,406 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2036 transitions. Word has length 48 [2024-10-11 07:03:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:15,407 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 2036 transitions. [2024-10-11 07:03:15,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) 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-10-11 07:03:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2036 transitions. [2024-10-11 07:03:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 07:03:15,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:15,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:15,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:03:15,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:15,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1394866242, now seen corresponding path program 1 times [2024-10-11 07:03:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773841551] [2024-10-11 07:03:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773841551] [2024-10-11 07:03:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773841551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:03:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939001205] [2024-10-11 07:03:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:15,899 INFO L87 Difference]: Start difference. First operand 1361 states and 2036 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-10-11 07:03:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:16,018 INFO L93 Difference]: Finished difference Result 2677 states and 4005 transitions. [2024-10-11 07:03:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:16,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-10-11 07:03:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:16,024 INFO L225 Difference]: With dead ends: 2677 [2024-10-11 07:03:16,025 INFO L226 Difference]: Without dead ends: 1379 [2024-10-11 07:03:16,026 INFO L431 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-10-11 07:03:16,027 INFO L432 NwaCegarLoop]: 2013 mSDtfsCounter, 12 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10053 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-10-11 07:03:16,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10053 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-10-11 07:03:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-10-11 07:03:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.4952727272727273) internal successors, (2056), 1375 states have internal predecessors, (2056), 0 states have call successors, (0), 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-10-11 07:03:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2056 transitions. [2024-10-11 07:03:16,055 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2056 transitions. Word has length 49 [2024-10-11 07:03:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2056 transitions. [2024-10-11 07:03:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-10-11 07:03:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2056 transitions. [2024-10-11 07:03:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 07:03:16,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:16,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:16,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:03:16,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 410288786, now seen corresponding path program 1 times [2024-10-11 07:03:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:16,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801535117] [2024-10-11 07:03:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801535117] [2024-10-11 07:03:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801535117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:16,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133760589] [2024-10-11 07:03:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:16,383 INFO L87 Difference]: Start difference. First operand 1376 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:16,470 INFO L93 Difference]: Finished difference Result 2695 states and 4028 transitions. [2024-10-11 07:03:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:16,475 INFO L225 Difference]: With dead ends: 2695 [2024-10-11 07:03:16,476 INFO L226 Difference]: Without dead ends: 1380 [2024-10-11 07:03:16,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-11 07:03:16,478 INFO L432 NwaCegarLoop]: 2012 mSDtfsCounter, 1991 mSDsluCounter, 4016 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 6028 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:16,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 6028 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-11 07:03:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-11 07:03:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.4938361131254532) internal successors, (2060), 1379 states have internal predecessors, (2060), 0 states have call successors, (0), 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-10-11 07:03:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2060 transitions. [2024-10-11 07:03:16,502 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2060 transitions. Word has length 50 [2024-10-11 07:03:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:16,503 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2060 transitions. [2024-10-11 07:03:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2060 transitions. [2024-10-11 07:03:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 07:03:16,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:16,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:03:16,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:16,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash 617706532, now seen corresponding path program 1 times [2024-10-11 07:03:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:16,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786902351] [2024-10-11 07:03:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:16,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:16,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786902351] [2024-10-11 07:03:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786902351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:16,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119241622] [2024-10-11 07:03:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:16,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:16,818 INFO L87 Difference]: Start difference. First operand 1380 states and 2060 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:16,941 INFO L93 Difference]: Finished difference Result 2926 states and 4368 transitions. [2024-10-11 07:03:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:16,947 INFO L225 Difference]: With dead ends: 2926 [2024-10-11 07:03:16,947 INFO L226 Difference]: Without dead ends: 1613 [2024-10-11 07:03:16,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 07:03:16,950 INFO L432 NwaCegarLoop]: 2006 mSDtfsCounter, 2663 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:16,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 6015 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2024-10-11 07:03:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1390. [2024-10-11 07:03:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.4917206623470123) internal successors, (2072), 1389 states have internal predecessors, (2072), 0 states have call successors, (0), 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-10-11 07:03:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2072 transitions. [2024-10-11 07:03:16,979 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2072 transitions. Word has length 50 [2024-10-11 07:03:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2072 transitions. [2024-10-11 07:03:16,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-10-11 07:03:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2072 transitions. [2024-10-11 07:03:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 07:03:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:16,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:03:16,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1480792464, now seen corresponding path program 1 times [2024-10-11 07:03:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729738495] [2024-10-11 07:03:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729738495] [2024-10-11 07:03:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729738495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:03:17,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943511565] [2024-10-11 07:03:17,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:17,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:03:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:17,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:03:17,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:17,458 INFO L87 Difference]: Start difference. First operand 1390 states and 2072 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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-10-11 07:03:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:17,624 INFO L93 Difference]: Finished difference Result 2725 states and 4064 transitions. [2024-10-11 07:03:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:03:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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-10-11 07:03:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:17,630 INFO L225 Difference]: With dead ends: 2725 [2024-10-11 07:03:17,630 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 07:03:17,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:17,633 INFO L432 NwaCegarLoop]: 2008 mSDtfsCounter, 5 mSDsluCounter, 12033 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14041 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:17,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14041 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 07:03:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1401. [2024-10-11 07:03:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.4907142857142857) internal successors, (2087), 1400 states have internal predecessors, (2087), 0 states have call successors, (0), 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-10-11 07:03:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2087 transitions. [2024-10-11 07:03:17,661 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2087 transitions. Word has length 51 [2024-10-11 07:03:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2087 transitions. [2024-10-11 07:03:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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-10-11 07:03:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2087 transitions. [2024-10-11 07:03:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 07:03:17,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:17,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:17,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:03:17,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1335622345, now seen corresponding path program 1 times [2024-10-11 07:03:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091300423] [2024-10-11 07:03:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091300423] [2024-10-11 07:03:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091300423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:03:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117360426] [2024-10-11 07:03:18,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:03:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:03:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:18,061 INFO L87 Difference]: Start difference. First operand 1401 states and 2087 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-10-11 07:03:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:18,194 INFO L93 Difference]: Finished difference Result 2735 states and 4079 transitions. [2024-10-11 07:03:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:03:18,195 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-10-11 07:03:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:18,200 INFO L225 Difference]: With dead ends: 2735 [2024-10-11 07:03:18,201 INFO L226 Difference]: Without dead ends: 1414 [2024-10-11 07:03:18,202 INFO L431 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-10-11 07:03:18,203 INFO L432 NwaCegarLoop]: 2009 mSDtfsCounter, 11 mSDsluCounter, 10035 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12044 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:18,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12044 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-10-11 07:03:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1413. [2024-10-11 07:03:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4886685552407932) internal successors, (2102), 1412 states have internal predecessors, (2102), 0 states have call successors, (0), 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-10-11 07:03:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2102 transitions. [2024-10-11 07:03:18,242 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2102 transitions. Word has length 51 [2024-10-11 07:03:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:18,243 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2102 transitions. [2024-10-11 07:03:18,243 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-10-11 07:03:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2102 transitions. [2024-10-11 07:03:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 07:03:18,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:18,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:03:18,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -907777260, now seen corresponding path program 1 times [2024-10-11 07:03:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485519688] [2024-10-11 07:03:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485519688] [2024-10-11 07:03:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485519688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:03:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381814191] [2024-10-11 07:03:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:03:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:03:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:03:18,838 INFO L87 Difference]: Start difference. First operand 1413 states and 2102 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-11 07:03:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:19,231 INFO L93 Difference]: Finished difference Result 2981 states and 4438 transitions. [2024-10-11 07:03:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:03:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-11 07:03:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:19,237 INFO L225 Difference]: With dead ends: 2981 [2024-10-11 07:03:19,238 INFO L226 Difference]: Without dead ends: 1651 [2024-10-11 07:03:19,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:03:19,241 INFO L432 NwaCegarLoop]: 1998 mSDtfsCounter, 2697 mSDsluCounter, 14301 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 16299 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:19,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2697 Valid, 16299 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-10-11 07:03:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1418. [2024-10-11 07:03:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.487649964714185) internal successors, (2108), 1417 states have internal predecessors, (2108), 0 states have call successors, (0), 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-10-11 07:03:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2108 transitions. [2024-10-11 07:03:19,270 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2108 transitions. Word has length 53 [2024-10-11 07:03:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:19,271 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2108 transitions. [2024-10-11 07:03:19,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-11 07:03:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2108 transitions. [2024-10-11 07:03:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 07:03:19,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:19,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:19,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:03:19,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1513427970, now seen corresponding path program 1 times [2024-10-11 07:03:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634570948] [2024-10-11 07:03:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634570948] [2024-10-11 07:03:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634570948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:03:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376435623] [2024-10-11 07:03:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:19,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:19,584 INFO L87 Difference]: Start difference. First operand 1418 states and 2108 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) 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-10-11 07:03:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:19,803 INFO L93 Difference]: Finished difference Result 3039 states and 4525 transitions. [2024-10-11 07:03:19,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-10-11 07:03:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:19,809 INFO L225 Difference]: With dead ends: 3039 [2024-10-11 07:03:19,810 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 07:03:19,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:19,812 INFO L432 NwaCegarLoop]: 2001 mSDtfsCounter, 2862 mSDsluCounter, 5993 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2862 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:19,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2862 Valid, 7994 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 07:03:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1404. [2024-10-11 07:03:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.4903777619387029) internal successors, (2091), 1403 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-10-11 07:03:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2091 transitions. [2024-10-11 07:03:19,839 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2091 transitions. Word has length 53 [2024-10-11 07:03:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:19,839 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2091 transitions. [2024-10-11 07:03:19,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-10-11 07:03:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2091 transitions. [2024-10-11 07:03:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 07:03:19,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:19,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:19,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:03:19,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:19,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:19,841 INFO L85 PathProgramCache]: Analyzing trace with hash -403202932, now seen corresponding path program 1 times [2024-10-11 07:03:19,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:19,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689848525] [2024-10-11 07:03:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689848525] [2024-10-11 07:03:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689848525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:20,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:03:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778334408] [2024-10-11 07:03:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:20,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:03:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:03:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:03:20,397 INFO L87 Difference]: Start difference. First operand 1404 states and 2091 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 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-10-11 07:03:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:20,621 INFO L93 Difference]: Finished difference Result 2741 states and 4087 transitions. [2024-10-11 07:03:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:03:20,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 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-10-11 07:03:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:20,627 INFO L225 Difference]: With dead ends: 2741 [2024-10-11 07:03:20,627 INFO L226 Difference]: Without dead ends: 1411 [2024-10-11 07:03:20,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-10-11 07:03:20,629 INFO L432 NwaCegarLoop]: 2004 mSDtfsCounter, 2012 mSDsluCounter, 12015 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 14019 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:20,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 14019 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-10-11 07:03:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1408. [2024-10-11 07:03:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 1.4896943852167732) internal successors, (2096), 1407 states have internal predecessors, (2096), 0 states have call successors, (0), 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-10-11 07:03:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2096 transitions. [2024-10-11 07:03:20,656 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2096 transitions. Word has length 54 [2024-10-11 07:03:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2096 transitions. [2024-10-11 07:03:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 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-10-11 07:03:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2096 transitions. [2024-10-11 07:03:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 07:03:20,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:20,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:03:20,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1950156370, now seen corresponding path program 1 times [2024-10-11 07:03:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45170869] [2024-10-11 07:03:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45170869] [2024-10-11 07:03:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45170869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:21,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458815574] [2024-10-11 07:03:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:21,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:21,036 INFO L87 Difference]: Start difference. First operand 1408 states and 2096 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 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-10-11 07:03:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:21,164 INFO L93 Difference]: Finished difference Result 2889 states and 4301 transitions. [2024-10-11 07:03:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:21,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 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-10-11 07:03:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:21,170 INFO L225 Difference]: With dead ends: 2889 [2024-10-11 07:03:21,170 INFO L226 Difference]: Without dead ends: 1547 [2024-10-11 07:03:21,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-11 07:03:21,173 INFO L432 NwaCegarLoop]: 2001 mSDtfsCounter, 2421 mSDsluCounter, 4001 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 6002 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:21,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 6002 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-11 07:03:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1400. [2024-10-11 07:03:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1399 states have (on average 1.4910650464617583) internal successors, (2086), 1399 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-10-11 07:03:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2086 transitions. [2024-10-11 07:03:21,203 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2086 transitions. Word has length 55 [2024-10-11 07:03:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:21,204 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2086 transitions. [2024-10-11 07:03:21,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 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-10-11 07:03:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2086 transitions. [2024-10-11 07:03:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 07:03:21,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:21,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:21,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:03:21,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:21,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1722292558, now seen corresponding path program 1 times [2024-10-11 07:03:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800538496] [2024-10-11 07:03:21,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:21,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:21,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800538496] [2024-10-11 07:03:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800538496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:03:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175345759] [2024-10-11 07:03:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:03:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:21,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:03:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:03:21,845 INFO L87 Difference]: Start difference. First operand 1400 states and 2086 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) 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-10-11 07:03:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:22,258 INFO L93 Difference]: Finished difference Result 2960 states and 4410 transitions. [2024-10-11 07:03:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:03:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) 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-10-11 07:03:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:22,265 INFO L225 Difference]: With dead ends: 2960 [2024-10-11 07:03:22,266 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 07:03:22,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-11 07:03:22,269 INFO L432 NwaCegarLoop]: 1995 mSDtfsCounter, 2662 mSDsluCounter, 15956 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 17951 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:22,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 17951 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 07:03:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1405. [2024-10-11 07:03:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4914529914529915) internal successors, (2094), 1404 states have internal predecessors, (2094), 0 states have call successors, (0), 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-10-11 07:03:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2094 transitions. [2024-10-11 07:03:22,297 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2094 transitions. Word has length 55 [2024-10-11 07:03:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2094 transitions. [2024-10-11 07:03:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) 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-10-11 07:03:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2094 transitions. [2024-10-11 07:03:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 07:03:22,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:22,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:22,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 07:03:22,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:22,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -661985942, now seen corresponding path program 1 times [2024-10-11 07:03:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650667280] [2024-10-11 07:03:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:22,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:03:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:22,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:03:22,495 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:03:22,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:03:22,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 07:03:22,501 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:22,580 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:03:22,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:03:22 BoogieIcfgContainer [2024-10-11 07:03:22,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:03:22,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:03:22,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:03:22,587 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:03:22,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:13" (3/4) ... [2024-10-11 07:03:22,590 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:03:22,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:03:22,592 INFO L158 Benchmark]: Toolchain (without parser) took 17001.03ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 102.5MB in the beginning and 511.8MB in the end (delta: -409.4MB). Peak memory consumption was 637.7MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,592 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:22,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 889.91ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 85.0MB in the end (delta: 17.5MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 768.23ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 85.0MB in the beginning and 121.8MB in the end (delta: -36.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,593 INFO L158 Benchmark]: Boogie Preprocessor took 842.66ms. Allocated memory is still 249.6MB. Free memory was 121.8MB in the beginning and 110.4MB in the end (delta: 11.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,593 INFO L158 Benchmark]: RCFGBuilder took 4986.40ms. Allocated memory was 249.6MB in the beginning and 675.3MB in the end (delta: 425.7MB). Free memory was 110.4MB in the beginning and 317.8MB in the end (delta: -207.5MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,593 INFO L158 Benchmark]: TraceAbstraction took 9495.95ms. Allocated memory was 675.3MB in the beginning and 1.2GB in the end (delta: 515.9MB). Free memory was 316.8MB in the beginning and 512.9MB in the end (delta: -196.1MB). Peak memory consumption was 320.9MB. Max. memory is 16.1GB. [2024-10-11 07:03:22,593 INFO L158 Benchmark]: Witness Printer took 7.35ms. Allocated memory is still 1.2GB. Free memory was 512.9MB in the beginning and 511.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:22,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 889.91ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 85.0MB in the end (delta: 17.5MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 768.23ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 85.0MB in the beginning and 121.8MB in the end (delta: -36.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 842.66ms. Allocated memory is still 249.6MB. Free memory was 121.8MB in the beginning and 110.4MB in the end (delta: 11.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4986.40ms. Allocated memory was 249.6MB in the beginning and 675.3MB in the end (delta: 425.7MB). Free memory was 110.4MB in the beginning and 317.8MB in the end (delta: -207.5MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9495.95ms. Allocated memory was 675.3MB in the beginning and 1.2GB in the end (delta: 515.9MB). Free memory was 316.8MB in the beginning and 512.9MB in the end (delta: -196.1MB). Peak memory consumption was 320.9MB. Max. memory is 16.1GB. * Witness Printer took 7.35ms. Allocated memory is still 1.2GB. Free memory was 512.9MB in the beginning and 511.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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, 1348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20009 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20009 mSDsluCounter, 128536 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102455 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 26081 mSDtfsCounter, 972 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1418occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1359 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 2324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-10-11 07:03:22,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 07:03:25,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:25,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:03:25,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:25,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:25,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:25,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:25,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:25,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:25,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:25,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:25,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:25,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:25,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:25,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:25,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:25,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:25,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:25,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:25,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:25,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:25,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:03:25,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:03:25,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:25,156 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:03:25,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:25,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:25,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:25,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:25,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:25,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:25,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:25,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:25,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:25,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:25,161 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:03:25,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:03:25,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:25,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:25,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:25,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:25,163 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:03:25,163 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-clean/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-clean/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-10-11 07:03:25,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:25,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:25,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:25,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:25,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:25,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:27,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:27,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:27,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:27,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc3cc54f5/7d6bc8e63b5d430693e711dc5ccbc195/FLAG745c7581b [2024-10-11 07:03:27,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc3cc54f5/7d6bc8e63b5d430693e711dc5ccbc195 [2024-10-11 07:03:27,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:27,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:27,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:27,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:27,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:27,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:27" (1/1) ... [2024-10-11 07:03:27,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ad8f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27, skipping insertion in model container [2024-10-11 07:03:27,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:27" (1/1) ... [2024-10-11 07:03:27,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:27,875 WARN L248 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-10-11 07:03:28,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:28,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:28,253 WARN L248 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-10-11 07:03:28,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:28,461 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:28,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28 WrapperNode [2024-10-11 07:03:28,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:28,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:28,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:28,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:28,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,648 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1833 [2024-10-11 07:03:28,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:28,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:28,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:28,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:28,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,722 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-10-11 07:03:28,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:28,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:28,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:28,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:28,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (1/1) ... [2024-10-11 07:03:28,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:28,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:28,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:03:28,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:03:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:03:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:29,272 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:29,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:32,279 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:32,279 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:32,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:32,354 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:32,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:32 BoogieIcfgContainer [2024-10-11 07:03:32,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:32,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:32,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:32,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:32,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:27" (1/3) ... [2024-10-11 07:03:32,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e4b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:32, skipping insertion in model container [2024-10-11 07:03:32,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:28" (2/3) ... [2024-10-11 07:03:32,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e4b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:32, skipping insertion in model container [2024-10-11 07:03:32,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:32" (3/3) ... [2024-10-11 07:03:32,365 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-11 07:03:32,382 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:32,382 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:32,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:32,444 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;@54354e02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:32,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 07:03:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:03:32,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:32,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:03:32,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:03:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937577587] [2024-10-11 07:03:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:32,479 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-10-11 07:03:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:32,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 07:03:32,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:03:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:32,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 07:03:32,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:33,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:03:33,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:03:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937577587] [2024-10-11 07:03:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937577587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:33,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:33,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:03:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350507421] [2024-10-11 07:03:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:03:33,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:33,143 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-11 07:03:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:33,292 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:03:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:33,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-11 07:03:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:33,301 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:03:33,302 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:03:33,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 07:03:33,310 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:33,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:03:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:03:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 07:03:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:03:33,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:03:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:33,340 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:03:33,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-11 07:03:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:03:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:03:33,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:33,342 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:03:33,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:03:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 07:03:33,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:03:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361064963] [2024-10-11 07:03:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:33,551 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-10-11 07:03:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:33,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 07:03:33,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:03:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:34,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:03:34,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:34,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:03:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:34,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:03:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361064963] [2024-10-11 07:03:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361064963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:03:34,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:03:34,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:03:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102240203] [2024-10-11 07:03:34,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:03:34,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:03:34,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:03:34,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:03:34,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:34,646 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:35,343 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-11 07:03:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:03:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 07:03:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:35,345 INFO L225 Difference]: With dead ends: 17 [2024-10-11 07:03:35,345 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 07:03:35,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:03:35,348 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:35,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:03:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 07:03:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-11 07:03:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-11 07:03:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 07:03:35,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-11 07:03:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:35,355 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 07:03:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 07:03:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 07:03:35,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:35,358 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-11 07:03:35,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:03:35,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 07:03:35,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-11 07:03:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411820899] [2024-10-11 07:03:35,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:03:35,567 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-10-11 07:03:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:35,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 07:03:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:03:37,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:03:37,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:03:37,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 07:03:37,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:37,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:03:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:38,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:03:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411820899] [2024-10-11 07:03:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411820899] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:03:38,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:03:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 07:03:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197289442] [2024-10-11 07:03:38,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:03:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:03:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:03:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:03:38,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:03:38,714 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 07:03:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:40,288 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-11 07:03:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 07:03:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 13 [2024-10-11 07:03:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:40,289 INFO L225 Difference]: With dead ends: 31 [2024-10-11 07:03:40,290 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 07:03:40,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 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-10-11 07:03:40,291 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:40,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:03:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 07:03:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-11 07:03:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-11 07:03:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-11 07:03:40,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2024-10-11 07:03:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:40,304 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-11 07:03:40,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 07:03:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-11 07:03:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 07:03:40,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:40,305 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2024-10-11 07:03:40,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 07:03:40,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 07:03:40,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 181792434, now seen corresponding path program 3 times [2024-10-11 07:03:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:40,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70344844] [2024-10-11 07:03:40,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 07:03:40,510 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-10-11 07:03:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:40,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 07:03:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:03:43,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 07:03:43,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:03:43,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-11 07:03:43,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:05,078 INFO L311 TraceCheckSpWp]: Computing backward predicates...