./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_vsaR_p13.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_vsaR_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:17,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:18,016 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:04:18,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:18,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:18,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:18,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:18,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:18,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:18,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:18,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:18,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:18,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:18,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:18,060 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:18,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:18,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:18,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:04:18,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:18,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:18,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:18,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:18,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:18,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:18,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:18,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:18,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:18,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:18,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:18,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:18,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:18,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:18,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:18,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:04:18,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:04:18,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:18,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:18,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:18,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:18,071 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2024-10-11 07:04:18,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:18,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:18,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:18,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:18,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:18,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:19,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:19,850 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:19,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:19,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b9169fec/c5a1440b2e4a4ea89fc41e593aef167b/FLAG8d25320a3 [2024-10-11 07:04:20,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b9169fec/c5a1440b2e4a4ea89fc41e593aef167b [2024-10-11 07:04:20,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:20,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:20,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:20,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:20,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:20,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:20,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d866086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20, skipping insertion in model container [2024-10-11 07:04:20,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:20,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:20,433 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_vsaR_p13.c[1259,1272] [2024-10-11 07:04:20,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:20,671 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:20,679 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_vsaR_p13.c[1259,1272] [2024-10-11 07:04:20,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:20,768 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:20,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20 WrapperNode [2024-10-11 07:04:20,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:20,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:20,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:20,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:20,775 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:04:20" (1/1) ... [2024-10-11 07:04:20,812 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:04:20" (1/1) ... [2024-10-11 07:04:21,012 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2160 [2024-10-11 07:04:21,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:21,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:21,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:21,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:21,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,126 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:04:21,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:21,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:21,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:21,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:21,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (1/1) ... [2024-10-11 07:04:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:21,319 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:04:21,324 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:04:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:04:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:21,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:21,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:23,327 INFO L? ?]: Removed 1352 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:23,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:23,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:23,401 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:23,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:23 BoogieIcfgContainer [2024-10-11 07:04:23,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:23,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:23,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:23,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:23,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:20" (1/3) ... [2024-10-11 07:04:23,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2646f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:23, skipping insertion in model container [2024-10-11 07:04:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:20" (2/3) ... [2024-10-11 07:04:23,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2646f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:23, skipping insertion in model container [2024-10-11 07:04:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:23" (3/3) ... [2024-10-11 07:04:23,410 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:23,425 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:23,425 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:23,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:23,511 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;@32634079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:23,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 544 states, 542 states have (on average 1.5018450184501846) internal successors, (814), 543 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:04:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 07:04:23,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:23,524 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] [2024-10-11 07:04:23,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:23,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1003663115, now seen corresponding path program 1 times [2024-10-11 07:04:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806480659] [2024-10-11 07:04:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:24,158 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:04:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806480659] [2024-10-11 07:04:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806480659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:24,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630038522] [2024-10-11 07:04:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:24,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:24,192 INFO L87 Difference]: Start difference. First operand has 544 states, 542 states have (on average 1.5018450184501846) internal successors, (814), 543 states have internal predecessors, (814), 0 states have call successors, (0), 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.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:04:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:24,288 INFO L93 Difference]: Finished difference Result 1036 states and 1552 transitions. [2024-10-11 07:04:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-11 07:04:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:24,305 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 07:04:24,305 INFO L226 Difference]: Without dead ends: 545 [2024-10-11 07:04:24,309 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:04:24,312 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2422 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:04:24,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2422 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-11 07:04:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2024-10-11 07:04:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:04:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2024-10-11 07:04:24,374 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 44 [2024-10-11 07:04:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2024-10-11 07:04:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:04:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2024-10-11 07:04:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 07:04:24,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:24,377 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] [2024-10-11 07:04:24,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:04:24,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:24,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1050480906, now seen corresponding path program 1 times [2024-10-11 07:04:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249138384] [2024-10-11 07:04:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:24,562 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:04:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249138384] [2024-10-11 07:04:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249138384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493283297] [2024-10-11 07:04:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:24,566 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:04:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:24,617 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2024-10-11 07:04:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-11 07:04:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:24,620 INFO L225 Difference]: With dead ends: 1039 [2024-10-11 07:04:24,620 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 07:04:24,622 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:04:24,623 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2419 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:04:24,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 07:04:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-10-11 07:04:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 0 states have call successors, (0), 0 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:04:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2024-10-11 07:04:24,643 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 45 [2024-10-11 07:04:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:24,643 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2024-10-11 07:04:24,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:04:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2024-10-11 07:04:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 07:04:24,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:24,645 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:04:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:04:24,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:24,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171332, now seen corresponding path program 1 times [2024-10-11 07:04:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:24,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248818839] [2024-10-11 07:04:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:25,089 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:04:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248818839] [2024-10-11 07:04:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248818839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:04:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673781383] [2024-10-11 07:04:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:25,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:04:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:04:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:04:25,094 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:04:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:25,164 INFO L93 Difference]: Finished difference Result 1047 states and 1562 transitions. [2024-10-11 07:04:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:04:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:04:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:25,167 INFO L225 Difference]: With dead ends: 1047 [2024-10-11 07:04:25,167 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 07:04:25,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:04:25,168 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 2 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:25,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4006 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 07:04:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 552. [2024-10-11 07:04:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4936479128856623) internal successors, (823), 551 states have internal predecessors, (823), 0 states have call successors, (0), 0 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:04:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 823 transitions. [2024-10-11 07:04:25,179 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 823 transitions. Word has length 46 [2024-10-11 07:04:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:25,179 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 823 transitions. [2024-10-11 07:04:25,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:04:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 823 transitions. [2024-10-11 07:04:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 07:04:25,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:25,180 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:04:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:04:25,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:25,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1571695512, now seen corresponding path program 1 times [2024-10-11 07:04:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638681969] [2024-10-11 07:04:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:25,301 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:04:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638681969] [2024-10-11 07:04:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638681969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:25,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23978482] [2024-10-11 07:04:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:25,305 INFO L87 Difference]: Start difference. First operand 552 states and 823 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:04:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:25,336 INFO L93 Difference]: Finished difference Result 1053 states and 1570 transitions. [2024-10-11 07:04:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:25,336 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:04:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:25,338 INFO L225 Difference]: With dead ends: 1053 [2024-10-11 07:04:25,340 INFO L226 Difference]: Without dead ends: 554 [2024-10-11 07:04:25,341 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:04:25,342 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2419 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:04:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-11 07:04:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-10-11 07:04:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.4918625678119348) internal successors, (825), 553 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:04:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 825 transitions. [2024-10-11 07:04:25,355 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 825 transitions. Word has length 47 [2024-10-11 07:04:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 825 transitions. [2024-10-11 07:04:25,356 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:04:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 825 transitions. [2024-10-11 07:04:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 07:04:25,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:25,360 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:04:25,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:04:25,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1591960769, now seen corresponding path program 1 times [2024-10-11 07:04:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031638683] [2024-10-11 07:04:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:25,995 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:04:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031638683] [2024-10-11 07:04:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031638683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:04:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330182552] [2024-10-11 07:04:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:25,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:04:25,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:25,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:04:25,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:04:25,999 INFO L87 Difference]: Start difference. First operand 554 states and 825 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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:04:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:26,130 INFO L93 Difference]: Finished difference Result 1062 states and 1580 transitions. [2024-10-11 07:04:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:04:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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:04:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:26,133 INFO L225 Difference]: With dead ends: 1062 [2024-10-11 07:04:26,133 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 07:04:26,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:04:26,136 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 785 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:26,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 3988 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 07:04:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2024-10-11 07:04:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 1.4901256732495511) internal successors, (830), 557 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:04:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 830 transitions. [2024-10-11 07:04:26,147 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 830 transitions. Word has length 48 [2024-10-11 07:04:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 830 transitions. [2024-10-11 07:04:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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:04:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 830 transitions. [2024-10-11 07:04:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 07:04:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:26,148 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:04:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:04:26,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:26,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2032041443, now seen corresponding path program 1 times [2024-10-11 07:04:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:26,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363464464] [2024-10-11 07:04:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:26,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:26,279 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:04:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363464464] [2024-10-11 07:04:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363464464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:26,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072996188] [2024-10-11 07:04:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:26,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:26,281 INFO L87 Difference]: Start difference. First operand 558 states and 830 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:26,310 INFO L93 Difference]: Finished difference Result 1065 states and 1584 transitions. [2024-10-11 07:04:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 07:04:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:26,313 INFO L225 Difference]: With dead ends: 1065 [2024-10-11 07:04:26,313 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 07:04:26,314 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:04:26,316 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2419 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:04:26,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 07:04:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-10-11 07:04:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.4883720930232558) internal successors, (832), 559 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:04:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 832 transitions. [2024-10-11 07:04:26,328 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 832 transitions. Word has length 48 [2024-10-11 07:04:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:26,328 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 832 transitions. [2024-10-11 07:04:26,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 832 transitions. [2024-10-11 07:04:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 07:04:26,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:26,332 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:04:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:04:26,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1298770367, now seen corresponding path program 1 times [2024-10-11 07:04:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234855614] [2024-10-11 07:04:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234855614] [2024-10-11 07:04:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234855614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:26,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:04:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670698771] [2024-10-11 07:04:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:26,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:04:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:04:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:04:26,486 INFO L87 Difference]: Start difference. First operand 560 states and 832 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:26,599 INFO L93 Difference]: Finished difference Result 1177 states and 1742 transitions. [2024-10-11 07:04:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:04:26,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 07:04:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:26,602 INFO L225 Difference]: With dead ends: 1177 [2024-10-11 07:04:26,602 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 07:04:26,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:26,604 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 1076 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:26,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 3198 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 07:04:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 568. [2024-10-11 07:04:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.4885361552028218) internal successors, (844), 567 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:04:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 844 transitions. [2024-10-11 07:04:26,612 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 844 transitions. Word has length 49 [2024-10-11 07:04:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 844 transitions. [2024-10-11 07:04:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 844 transitions. [2024-10-11 07:04:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 07:04:26,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:26,614 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:04:26,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:04:26,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -624278352, now seen corresponding path program 1 times [2024-10-11 07:04:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:26,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659550793] [2024-10-11 07:04:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:26,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:04:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:26,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:04:26,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:04:26,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:04:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:04:26,773 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:26,834 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:04:26,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:04:26 BoogieIcfgContainer [2024-10-11 07:04:26,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:04:26,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:04:26,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:04:26,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:04:26,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:23" (3/4) ... [2024-10-11 07:04:26,844 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:04:26,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:04:26,846 INFO L158 Benchmark]: Toolchain (without parser) took 6653.55ms. Allocated memory was 153.1MB in the beginning and 381.7MB in the end (delta: 228.6MB). Free memory was 94.4MB in the beginning and 211.3MB in the end (delta: -116.8MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,846 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:26,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.60ms. Allocated memory is still 153.1MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 243.69ms. Allocated memory is still 153.1MB. Free memory was 92.2MB in the beginning and 85.4MB in the end (delta: 6.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,847 INFO L158 Benchmark]: Boogie Preprocessor took 274.41ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 85.4MB in the beginning and 146.9MB in the end (delta: -61.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,847 INFO L158 Benchmark]: RCFGBuilder took 2113.43ms. Allocated memory was 211.8MB in the beginning and 314.6MB in the end (delta: 102.8MB). Free memory was 146.9MB in the beginning and 208.2MB in the end (delta: -61.4MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,849 INFO L158 Benchmark]: TraceAbstraction took 3437.07ms. Allocated memory was 314.6MB in the beginning and 381.7MB in the end (delta: 67.1MB). Free memory was 207.2MB in the beginning and 211.3MB in the end (delta: -4.1MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-10-11 07:04:26,850 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 381.7MB. Free memory is still 211.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:26,851 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 96.5MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.60ms. Allocated memory is still 153.1MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 243.69ms. Allocated memory is still 153.1MB. Free memory was 92.2MB in the beginning and 85.4MB in the end (delta: 6.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 274.41ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 85.4MB in the beginning and 146.9MB in the end (delta: -61.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2113.43ms. Allocated memory was 211.8MB in the beginning and 314.6MB in the end (delta: 102.8MB). Free memory was 146.9MB in the beginning and 208.2MB in the end (delta: -61.4MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3437.07ms. Allocated memory was 314.6MB in the beginning and 381.7MB in the end (delta: 67.1MB). Free memory was 207.2MB in the beginning and 211.3MB in the end (delta: -4.1MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 381.7MB. Free memory is still 211.3MB. 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 177, overapproximation of bitwiseAnd at line 182. 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 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_80 mask_SORT_80 = (SORT_80)-1 >> (sizeof(SORT_80) * 8 - 32); [L39] const SORT_80 msb_SORT_80 = (SORT_80)1 << (32 - 1); [L41] const SORT_91 mask_SORT_91 = (SORT_91)-1 >> (sizeof(SORT_91) * 8 - 4); [L42] const SORT_91 msb_SORT_91 = (SORT_91)1 << (4 - 1); [L44] const SORT_176 mask_SORT_176 = (SORT_176)-1 >> (sizeof(SORT_176) * 8 - 2); [L45] const SORT_176 msb_SORT_176 = (SORT_176)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_23 = 0; [L52] const SORT_1 var_39 = 1; [L53] const SORT_7 var_59 = 1; [L54] const SORT_7 var_64 = 4; [L55] const SORT_7 var_66 = 5; [L56] const SORT_7 var_70 = 3; [L57] const SORT_80 var_82 = 0; [L58] const SORT_7 var_108 = 7; [L59] const SORT_7 var_113 = 6; [L60] const SORT_3 var_140 = 2; [L61] const SORT_3 var_185 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_173; [L67] SORT_3 input_174; [L68] SORT_3 input_175; [L69] SORT_3 input_184; [L70] SORT_3 input_194; [L71] SORT_3 input_195; [L72] SORT_3 input_196; [L73] SORT_3 input_199; [L74] SORT_3 input_218; [L75] SORT_3 input_219; [L76] SORT_3 input_220; [L77] SORT_3 input_223; [L78] SORT_3 input_225; [L79] SORT_176 input_239; [L80] SORT_176 input_240; [L81] SORT_176 input_241; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L86] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L87] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L88] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L89] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L90] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L91] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L92] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L93] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L94] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L95] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_25_arg_1 = var_23; [L104] state_24 = init_25_arg_1 [L105] SORT_3 init_27_arg_1 = var_23; [L106] state_26 = init_27_arg_1 [L107] SORT_3 init_33_arg_1 = var_23; [L108] state_32 = init_33_arg_1 [L109] SORT_3 init_44_arg_1 = var_23; [L110] state_43 = init_44_arg_1 [L111] SORT_3 init_46_arg_1 = var_23; [L112] state_45 = init_46_arg_1 [L113] SORT_3 init_48_arg_1 = var_23; [L114] state_47 = init_48_arg_1 [L115] SORT_3 init_50_arg_1 = var_23; [L116] state_49 = init_50_arg_1 [L117] SORT_3 init_52_arg_1 = var_23; [L118] state_51 = init_52_arg_1 [L119] SORT_3 init_54_arg_1 = var_23; [L120] state_53 = init_54_arg_1 [L121] SORT_3 init_56_arg_1 = var_23; [L122] state_55 = init_56_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_173 = __VERIFIER_nondet_uchar() [L129] input_174 = __VERIFIER_nondet_uchar() [L130] input_175 = __VERIFIER_nondet_uchar() [L131] input_184 = __VERIFIER_nondet_uchar() [L132] input_194 = __VERIFIER_nondet_uchar() [L133] input_195 = __VERIFIER_nondet_uchar() [L134] input_196 = __VERIFIER_nondet_uchar() [L135] input_199 = __VERIFIER_nondet_uchar() [L136] input_218 = __VERIFIER_nondet_uchar() [L137] input_219 = __VERIFIER_nondet_uchar() [L138] input_220 = __VERIFIER_nondet_uchar() [L139] input_223 = __VERIFIER_nondet_uchar() [L140] input_225 = __VERIFIER_nondet_uchar() [L141] input_239 = __VERIFIER_nondet_uchar() [L142] input_240 = __VERIFIER_nondet_uchar() [L143] input_241 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_15=0, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_11; [L155] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_18_arg_0=0, var_18_arg_1=0, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] EXPR var_18_arg_0 & var_18_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L157] SORT_1 var_22_arg_0 = var_18; [L158] SORT_1 var_22_arg_1 = state_20; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_22_arg_0=0, var_22_arg_1=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L160] SORT_3 var_28_arg_0 = state_24; [L161] SORT_3 var_28_arg_1 = state_26; [L162] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L163] SORT_1 var_29_arg_0 = var_28; [L164] SORT_1 var_29 = ~var_29_arg_0; [L165] SORT_1 var_30_arg_0 = var_22; [L166] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_30_arg_0=0, var_30_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L168] SORT_1 var_31_arg_0 = var_30; [L169] SORT_1 var_31 = ~var_31_arg_0; [L170] SORT_3 var_34_arg_0 = state_32; [L171] SORT_3 var_34_arg_1 = state_26; [L172] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L173] SORT_1 var_35_arg_0 = var_34; [L174] SORT_1 var_35 = ~var_35_arg_0; [L175] SORT_1 var_36_arg_0 = var_31; [L176] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_36_arg_0=-1, var_36_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L178] SORT_1 var_40_arg_0 = var_36; [L179] SORT_1 var_40 = ~var_40_arg_0; [L180] SORT_1 var_41_arg_0 = var_39; [L181] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-254, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L183] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L183] var_41 = var_41 & mask_SORT_1 [L184] SORT_1 bad_42_arg_0 = var_41; [L185] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 544 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1863 mSDsluCounter, 20871 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15231 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5640 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 106 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:04:26,884 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_vsaR_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:28,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:28,841 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:04:28,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:28,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:28,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:28,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:28,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:28,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:28,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:28,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:28,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:28,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:28,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:28,875 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:28,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:28,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:28,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:28,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:28,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:28,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:28,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:04:28,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:04:28,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:28,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:04:28,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:28,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:28,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:28,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:28,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:28,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:28,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:28,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:28,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:28,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:28,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:28,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:04:28,894 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2024-10-11 07:04:29,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:29,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:29,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:29,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:29,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:29,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:30,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:30,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:30,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:30,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbd8c406c/55350580ffb64503a07513a78439fc55/FLAG055cea6c1 [2024-10-11 07:04:30,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cbd8c406c/55350580ffb64503a07513a78439fc55 [2024-10-11 07:04:30,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:30,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:30,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:30,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:30,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:30,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:30" (1/1) ... [2024-10-11 07:04:30,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279a75cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:30, skipping insertion in model container [2024-10-11 07:04:30,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:30" (1/1) ... [2024-10-11 07:04:30,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:31,078 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_vsaR_p13.c[1259,1272] [2024-10-11 07:04:31,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:31,302 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:31,313 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_vsaR_p13.c[1259,1272] [2024-10-11 07:04:31,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:31,404 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:31,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31 WrapperNode [2024-10-11 07:04:31,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:31,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:31,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:31,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:31,412 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:04:31" (1/1) ... [2024-10-11 07:04:31,445 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:04:31" (1/1) ... [2024-10-11 07:04:31,524 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1086 [2024-10-11 07:04:31,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:31,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:31,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:31,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:31,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,599 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:04:31,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:31,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:31,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:31,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:31,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (1/1) ... [2024-10-11 07:04:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:31,686 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:04:31,689 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:04:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:04:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:31,939 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:31,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:32,915 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:32,915 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:32,956 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:32,956 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:32,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:32 BoogieIcfgContainer [2024-10-11 07:04:32,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:32,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:32,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:32,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:32,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:30" (1/3) ... [2024-10-11 07:04:32,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd16b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:32, skipping insertion in model container [2024-10-11 07:04:32,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:31" (2/3) ... [2024-10-11 07:04:32,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd16b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:32, skipping insertion in model container [2024-10-11 07:04:32,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:32" (3/3) ... [2024-10-11 07:04:32,965 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-10-11 07:04:32,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:32,980 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:33,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:33,036 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;@a1a65fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:33,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:33,040 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:04:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:04:33,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:33,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:04:33,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:04:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512764053] [2024-10-11 07:04:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:33,068 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:04:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:33,071 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:04:33,072 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:04:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:33,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:04:33,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:33,457 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:04:33,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:04:33,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512764053] [2024-10-11 07:04:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512764053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:33,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:04:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913151628] [2024-10-11 07:04:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:33,483 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:04:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:33,546 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:04:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:33,548 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:04:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:33,554 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:04:33,555 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:04:33,557 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:04:33,560 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:33,561 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.0s Time] [2024-10-11 07:04:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:04:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:04:33,582 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:04:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:04:33,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:04:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:33,584 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:04:33,585 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:04:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:04:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:04:33,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:33,586 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:04:33,593 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:04:33,786 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:04:33,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:33,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:04:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128992321] [2024-10-11 07:04:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:33,789 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:04:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:33,815 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:04:33,817 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:04:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:34,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 07:04:34,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:38,330 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:04:38,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:05:11,000 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:05:11,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:05:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128992321] [2024-10-11 07:05:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128992321] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:05:11,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:05:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:05:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015775922] [2024-10-11 07:05:11,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:05:11,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:05:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:05:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:05:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:05:11,004 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:05:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:11,163 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 07:05:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:05:11,163 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:05:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:11,164 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:05:11,164 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 07:05:11,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:05:11,166 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:11,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:05:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 07:05:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 07:05:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:05:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:05:11,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:05:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:11,170 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:05:11,170 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:05:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:05:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:05:11,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:11,171 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:05:11,177 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:05:11,371 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:05:11,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:05:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:05:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560824654] [2024-10-11 07:05:11,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:05:11,374 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:05:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:05:11,376 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:05:11,377 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:05:11,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:05:11,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:05:11,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 07:05:11,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:05:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:05:11,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:05:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:05:21,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:05:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560824654] [2024-10-11 07:05:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560824654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:05:21,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:05:21,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 07:05:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728062670] [2024-10-11 07:05:21,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:05:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:05:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:05:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:05:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2024-10-11 07:05:21,356 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:05:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:23,085 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-11 07:05:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:05:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 10 [2024-10-11 07:05:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:23,086 INFO L225 Difference]: With dead ends: 20 [2024-10-11 07:05:23,087 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 07:05:23,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=67, Invalid=141, Unknown=2, NotChecked=0, Total=210 [2024-10-11 07:05:23,088 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:23,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:05:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 07:05:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-11 07:05:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 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:05:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-11 07:05:23,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2024-10-11 07:05:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:23,092 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-11 07:05:23,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:05:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-11 07:05:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 07:05:23,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:23,092 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2024-10-11 07:05:23,099 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:05:23,295 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:05:23,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:23,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash 181792434, now seen corresponding path program 3 times [2024-10-11 07:05:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:05:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45270336] [2024-10-11 07:05:23,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 07:05:23,298 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:05:23,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:05:23,300 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:05:23,302 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:05:23,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 07:05:23,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:05:23,775 WARN L253 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 07:05:23,790 INFO L278 TraceCheckSpWp]: Computing forward predicates...