./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:58:02,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:58:02,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:58:02,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:58:02,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:58:02,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:58:02,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:58:02,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:58:02,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:58:02,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:58:02,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:58:02,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:58:02,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:58:02,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:58:02,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:58:02,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:58:02,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:58:02,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:58:02,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:58:02,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:58:02,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:58:02,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:58:02,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:58:02,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:58:02,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:58:02,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:58:02,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:58:02,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:58:02,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:58:02,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:02,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:58:02,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:58:02,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:58:02,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:58:02,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:58:02,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:58:02,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:58:02,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:58:02,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:58:02,357 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2024-11-12 00:58:02,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:58:02,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:58:02,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:58:02,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:58:02,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:58:02,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:04,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:58:04,374 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:58:04,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:04,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7797e067/b2c4716408c942d1a432a7bffc0c13ad/FLAGde5300ab5 [2024-11-12 00:58:04,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7797e067/b2c4716408c942d1a432a7bffc0c13ad [2024-11-12 00:58:04,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:58:04,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:58:04,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:04,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:58:04,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:58:04,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:04" (1/1) ... [2024-11-12 00:58:04,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165de232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:04, skipping insertion in model container [2024-11-12 00:58:04,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:04" (1/1) ... [2024-11-12 00:58:04,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:58:04,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-12 00:58:05,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:05,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:58:05,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-12 00:58:05,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:05,375 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:58:05,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05 WrapperNode [2024-11-12 00:58:05,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:05,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:05,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:58:05,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:58:05,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,706 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2149 [2024-11-12 00:58:05,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:05,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:58:05,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:58:05,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:58:05,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:58:05,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:05,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:06,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:06,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:06,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:58:06,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:58:06,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:58:06,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:58:06,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (1/1) ... [2024-11-12 00:58:06,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:58:06,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:58:06,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:58:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:58:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:58:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:58:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:58:06,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:58:06,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:58:08,502 INFO L? ?]: Removed 1344 outVars from TransFormulas that were not future-live. [2024-11-12 00:58:08,502 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:58:08,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:58:08,530 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:58:08,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:08 BoogieIcfgContainer [2024-11-12 00:58:08,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:58:08,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:58:08,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:58:08,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:58:08,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:58:04" (1/3) ... [2024-11-12 00:58:08,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab6e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:08, skipping insertion in model container [2024-11-12 00:58:08,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:05" (2/3) ... [2024-11-12 00:58:08,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab6e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:08, skipping insertion in model container [2024-11-12 00:58:08,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:08" (3/3) ... [2024-11-12 00:58:08,540 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:08,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:58:08,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:58:08,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:58:08,673 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;@6dc0ce54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:58:08,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:58:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 00:58:08,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:08,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:08,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:08,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1728403634, now seen corresponding path program 1 times [2024-11-12 00:58:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:08,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299091117] [2024-11-12 00:58:08,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299091117] [2024-11-12 00:58:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299091117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365370320] [2024-11-12 00:58:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:09,456 INFO L87 Difference]: Start difference. First operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 0 states have call successors, (0), 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.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-11-12 00:58:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:09,573 INFO L93 Difference]: Finished difference Result 1031 states and 1543 transitions. [2024-11-12 00:58:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:09,579 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-11-12 00:58:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:09,593 INFO L225 Difference]: With dead ends: 1031 [2024-11-12 00:58:09,594 INFO L226 Difference]: Without dead ends: 542 [2024-11-12 00:58:09,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:09,604 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:09,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2409 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-12 00:58:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2024-11-12 00:58:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4953789279112755) internal successors, (809), 541 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 809 transitions. [2024-11-12 00:58:09,665 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 809 transitions. Word has length 45 [2024-11-12 00:58:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 809 transitions. [2024-11-12 00:58:09,667 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-11-12 00:58:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 809 transitions. [2024-11-12 00:58:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 00:58:09,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:09,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:09,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:58:09,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:09,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2042600515, now seen corresponding path program 1 times [2024-11-12 00:58:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003604508] [2024-11-12 00:58:09,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003604508] [2024-11-12 00:58:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003604508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028870950] [2024-11-12 00:58:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:09,927 INFO L87 Difference]: Start difference. First operand 542 states and 809 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:09,972 INFO L93 Difference]: Finished difference Result 1032 states and 1541 transitions. [2024-11-12 00:58:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-12 00:58:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:09,978 INFO L225 Difference]: With dead ends: 1032 [2024-11-12 00:58:09,979 INFO L226 Difference]: Without dead ends: 544 [2024-11-12 00:58:09,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:09,983 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:09,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-12 00:58:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2024-11-12 00:58:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4935543278084715) internal successors, (811), 543 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 811 transitions. [2024-11-12 00:58:10,015 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 811 transitions. Word has length 46 [2024-11-12 00:58:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 811 transitions. [2024-11-12 00:58:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 811 transitions. [2024-11-12 00:58:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 00:58:10,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:10,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:58:10,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2093108139, now seen corresponding path program 1 times [2024-11-12 00:58:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397600078] [2024-11-12 00:58:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397600078] [2024-11-12 00:58:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397600078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452903256] [2024-11-12 00:58:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:10,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:10,470 INFO L87 Difference]: Start difference. First operand 544 states and 811 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-11-12 00:58:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:10,511 INFO L93 Difference]: Finished difference Result 1038 states and 1548 transitions. [2024-11-12 00:58:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-12 00:58:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:10,515 INFO L225 Difference]: With dead ends: 1038 [2024-11-12 00:58:10,515 INFO L226 Difference]: Without dead ends: 548 [2024-11-12 00:58:10,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:10,519 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 2 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:10,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2399 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-12 00:58:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2024-11-12 00:58:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.491743119266055) internal successors, (813), 545 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 813 transitions. [2024-11-12 00:58:10,533 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 813 transitions. Word has length 47 [2024-11-12 00:58:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:10,534 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 813 transitions. [2024-11-12 00:58:10,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 813 transitions. [2024-11-12 00:58:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:58:10,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:10,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:10,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:58:10,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:10,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1370729930, now seen corresponding path program 1 times [2024-11-12 00:58:10,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:10,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167019965] [2024-11-12 00:58:10,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:10,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167019965] [2024-11-12 00:58:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167019965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:10,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:58:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872768341] [2024-11-12 00:58:10,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:10,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:58:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:58:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:58:10,837 INFO L87 Difference]: Start difference. First operand 546 states and 813 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:10,908 INFO L93 Difference]: Finished difference Result 1042 states and 1552 transitions. [2024-11-12 00:58:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:58:10,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 00:58:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:10,911 INFO L225 Difference]: With dead ends: 1042 [2024-11-12 00:58:10,911 INFO L226 Difference]: Without dead ends: 550 [2024-11-12 00:58:10,914 INFO L434 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-11-12 00:58:10,915 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 1 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:10,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3990 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-12 00:58:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2024-11-12 00:58:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4908759124087592) internal successors, (817), 548 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 817 transitions. [2024-11-12 00:58:10,928 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 817 transitions. Word has length 48 [2024-11-12 00:58:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 817 transitions. [2024-11-12 00:58:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 817 transitions. [2024-11-12 00:58:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:58:10,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:10,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:10,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:58:10,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:10,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1515900049, now seen corresponding path program 1 times [2024-11-12 00:58:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:10,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564136071] [2024-11-12 00:58:10,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564136071] [2024-11-12 00:58:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564136071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:58:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908605358] [2024-11-12 00:58:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:11,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:58:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:58:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:58:11,106 INFO L87 Difference]: Start difference. First operand 549 states and 817 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:11,151 INFO L93 Difference]: Finished difference Result 1050 states and 1563 transitions. [2024-11-12 00:58:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:58:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 00:58:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:11,154 INFO L225 Difference]: With dead ends: 1050 [2024-11-12 00:58:11,154 INFO L226 Difference]: Without dead ends: 555 [2024-11-12 00:58:11,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:58:11,157 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 4 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:11,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3204 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-12 00:58:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-12 00:58:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4891696750902528) internal successors, (825), 554 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-11-12 00:58:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 825 transitions. [2024-11-12 00:58:11,170 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 825 transitions. Word has length 48 [2024-11-12 00:58:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:11,171 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 825 transitions. [2024-11-12 00:58:11,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 825 transitions. [2024-11-12 00:58:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:58:11,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:11,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:11,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:58:11,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:11,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -327612963, now seen corresponding path program 1 times [2024-11-12 00:58:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428551848] [2024-11-12 00:58:11,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428551848] [2024-11-12 00:58:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428551848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:58:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168820897] [2024-11-12 00:58:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:58:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:58:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:58:11,531 INFO L87 Difference]: Start difference. First operand 555 states and 825 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:11,759 INFO L93 Difference]: Finished difference Result 1252 states and 1857 transitions. [2024-11-12 00:58:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:58:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 00:58:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:11,763 INFO L225 Difference]: With dead ends: 1252 [2024-11-12 00:58:11,763 INFO L226 Difference]: Without dead ends: 751 [2024-11-12 00:58:11,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:58:11,767 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1343 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:11,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 3137 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:58:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-12 00:58:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 561. [2024-11-12 00:58:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4875) internal successors, (833), 560 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 833 transitions. [2024-11-12 00:58:11,782 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 833 transitions. Word has length 49 [2024-11-12 00:58:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:11,783 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 833 transitions. [2024-11-12 00:58:11,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 833 transitions. [2024-11-12 00:58:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:58:11,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:11,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:11,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:58:11,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -137698584, now seen corresponding path program 1 times [2024-11-12 00:58:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:11,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565790653] [2024-11-12 00:58:11,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565790653] [2024-11-12 00:58:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565790653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:58:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469316842] [2024-11-12 00:58:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:58:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:58:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:58:12,340 INFO L87 Difference]: Start difference. First operand 561 states and 833 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:12,453 INFO L93 Difference]: Finished difference Result 1067 states and 1585 transitions. [2024-11-12 00:58:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:58:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 00:58:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:12,456 INFO L225 Difference]: With dead ends: 1067 [2024-11-12 00:58:12,456 INFO L226 Difference]: Without dead ends: 566 [2024-11-12 00:58:12,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:58:12,458 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 778 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:12,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 3964 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-12 00:58:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2024-11-12 00:58:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4858156028368794) internal successors, (838), 564 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 838 transitions. [2024-11-12 00:58:12,470 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 838 transitions. Word has length 49 [2024-11-12 00:58:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:12,470 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 838 transitions. [2024-11-12 00:58:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 838 transitions. [2024-11-12 00:58:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:58:12,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:12,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:12,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:58:12,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:12,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1590856553, now seen corresponding path program 1 times [2024-11-12 00:58:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72519199] [2024-11-12 00:58:12,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:58:12,524 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:58:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:58:12,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:58:12,627 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:58:12,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:58:12,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:58:12,632 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:12,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:58:12,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:58:12 BoogieIcfgContainer [2024-11-12 00:58:12,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:58:12,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:58:12,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:58:12,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:58:12,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:08" (3/4) ... [2024-11-12 00:58:12,700 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:58:12,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:58:12,701 INFO L158 Benchmark]: Toolchain (without parser) took 8022.59ms. Allocated memory was 151.0MB in the beginning and 364.9MB in the end (delta: 213.9MB). Free memory was 78.6MB in the beginning and 79.4MB in the end (delta: -842.0kB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,702 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:58:12,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.82ms. Allocated memory is still 151.0MB. Free memory was 78.4MB in the beginning and 83.0MB in the end (delta: -4.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 330.36ms. Allocated memory is still 151.0MB. Free memory was 83.0MB in the beginning and 88.4MB in the end (delta: -5.4MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,703 INFO L158 Benchmark]: Boogie Preprocessor took 368.63ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 88.4MB in the beginning and 164.8MB in the end (delta: -76.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,703 INFO L158 Benchmark]: RCFGBuilder took 2453.83ms. Allocated memory is still 237.0MB. Free memory was 164.8MB in the beginning and 86.3MB in the end (delta: 78.5MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,703 INFO L158 Benchmark]: TraceAbstraction took 4163.48ms. Allocated memory was 237.0MB in the beginning and 364.9MB in the end (delta: 127.9MB). Free memory was 85.2MB in the beginning and 79.4MB in the end (delta: 5.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2024-11-12 00:58:12,703 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 364.9MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:58:12,705 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.82ms. Allocated memory is still 151.0MB. Free memory was 78.4MB in the beginning and 83.0MB in the end (delta: -4.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 330.36ms. Allocated memory is still 151.0MB. Free memory was 83.0MB in the beginning and 88.4MB in the end (delta: -5.4MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 368.63ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 88.4MB in the beginning and 164.8MB in the end (delta: -76.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2453.83ms. Allocated memory is still 237.0MB. Free memory was 164.8MB in the beginning and 86.3MB in the end (delta: 78.5MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4163.48ms. Allocated memory was 237.0MB in the beginning and 364.9MB in the end (delta: 127.9MB). Free memory was 85.2MB in the beginning and 79.4MB in the end (delta: 5.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 364.9MB. Free memory is still 79.4MB. 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 175, overapproximation of bitwiseAnd at line 180. 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_20 mask_SORT_20 = (SORT_20)-1 >> (sizeof(SORT_20) * 8 - 2); [L39] const SORT_20 msb_SORT_20 = (SORT_20)1 << (2 - 1); [L41] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 4); [L42] const SORT_85 msb_SORT_85 = (SORT_85)1 << (4 - 1); [L44] const SORT_150 mask_SORT_150 = (SORT_150)-1 >> (sizeof(SORT_150) * 8 - 32); [L45] const SORT_150 msb_SORT_150 = (SORT_150)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_7 var_11 = 4; [L49] const SORT_5 var_13 = 0; [L50] const SORT_7 var_17 = 2; [L51] const SORT_20 var_22 = 0; [L52] const SORT_3 var_26 = 0; [L53] const SORT_1 var_35 = 1; [L54] const SORT_1 var_43 = 0; [L55] const SORT_7 var_60 = 1; [L56] const SORT_7 var_66 = 5; [L57] const SORT_7 var_70 = 3; [L58] const SORT_7 var_102 = 7; [L59] const SORT_7 var_107 = 6; [L60] const SORT_150 var_152 = 0; [L61] const SORT_3 var_167 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_195; [L74] SORT_3 input_198; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_219; [L78] SORT_3 input_222; [L79] SORT_3 input_224; [L80] SORT_20 input_238; [L81] SORT_20 input_239; [L82] SORT_20 input_240; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L84] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L85] SORT_5 state_14 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L90] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L91] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L92] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L93] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L94] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L95] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L96] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_7 init_10_arg_1 = var_8; [L99] state_9 = init_10_arg_1 [L100] SORT_5 init_15_arg_1 = var_13; [L101] state_14 = init_15_arg_1 [L102] SORT_3 init_28_arg_1 = var_26; [L103] state_27 = init_28_arg_1 [L104] SORT_3 init_30_arg_1 = var_26; [L105] state_29 = init_30_arg_1 [L106] SORT_3 init_40_arg_1 = var_26; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_42_arg_1 = var_26; [L109] state_41 = init_42_arg_1 [L110] SORT_1 init_45_arg_1 = var_43; [L111] state_44 = init_45_arg_1 [L112] SORT_3 init_47_arg_1 = var_26; [L113] state_46 = init_47_arg_1 [L114] SORT_3 init_49_arg_1 = var_26; [L115] state_48 = init_49_arg_1 [L116] SORT_3 init_51_arg_1 = var_26; [L117] state_50 = init_51_arg_1 [L118] SORT_3 init_53_arg_1 = var_26; [L119] state_52 = init_53_arg_1 [L120] SORT_3 init_55_arg_1 = var_26; [L121] state_54 = init_55_arg_1 [L122] SORT_3 init_57_arg_1 = var_26; [L123] state_56 = init_57_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_195 = __VERIFIER_nondet_uchar() [L136] input_198 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_219 = __VERIFIER_nondet_uchar() [L140] input_222 = __VERIFIER_nondet_uchar() [L141] input_224 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L144] input_240 = __VERIFIER_nondet_uchar() [L147] SORT_7 var_12_arg_0 = state_9; [L148] SORT_7 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_5 var_16_arg_0 = state_14; [L151] SORT_7 var_16 = var_16_arg_0 >> 9; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] EXPR var_16 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] var_16 = var_16 & mask_SORT_7 [L153] SORT_7 var_18_arg_0 = var_16; [L154] SORT_7 var_18_arg_1 = var_17; [L155] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L156] SORT_1 var_19_arg_0 = var_12; [L157] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19_arg_0=0, var_19_arg_1=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L159] SORT_5 var_21_arg_0 = state_14; [L160] SORT_20 var_21 = var_21_arg_0 >> 7; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_21=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] EXPR var_21 & mask_SORT_20 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] var_21 = var_21 & mask_SORT_20 [L162] SORT_20 var_23_arg_0 = var_21; [L163] SORT_20 var_23_arg_1 = var_22; [L164] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L165] SORT_1 var_24_arg_0 = var_19; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] SORT_1 var_25_arg_0 = var_24; [L169] SORT_1 var_25 = ~var_25_arg_0; [L170] SORT_3 var_31_arg_0 = state_27; [L171] SORT_3 var_31_arg_1 = state_29; [L172] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L173] SORT_1 var_32_arg_0 = var_25; [L174] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L176] SORT_1 var_36_arg_0 = var_32; [L177] SORT_1 var_36 = ~var_36_arg_0; [L178] SORT_1 var_37_arg_0 = var_35; [L179] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L181] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L181] var_37 = var_37 & mask_SORT_1 [L182] SORT_1 bad_38_arg_0 = var_37; [L183] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 543 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2128 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2128 mSDsluCounter, 21508 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15910 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 5598 mSDtfsCounter, 276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565occurred 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, 194 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 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-11-12 00:58:12,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:58:14,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:58:15,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:58:15,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:58:15,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:58:15,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:58:15,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:58:15,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:58:15,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:58:15,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:58:15,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:58:15,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:58:15,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:58:15,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:58:15,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:58:15,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:58:15,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:58:15,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:58:15,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:58:15,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:58:15,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:58:15,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:58:15,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:58:15,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:58:15,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:58:15,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:58:15,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:58:15,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:58:15,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:58:15,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:58:15,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:58:15,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:15,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:58:15,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:58:15,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:58:15,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:58:15,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:58:15,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:58:15,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:58:15,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:58:15,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:58:15,123 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2024-11-12 00:58:15,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:58:15,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:58:15,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:58:15,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:58:15,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:58:15,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:16,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:58:17,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:58:17,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:17,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a799d4418/b73fa358ff4b418c9890a4ad593a71ad/FLAG580312780 [2024-11-12 00:58:17,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a799d4418/b73fa358ff4b418c9890a4ad593a71ad [2024-11-12 00:58:17,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:58:17,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:58:17,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:17,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:58:17,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:58:17,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:17" (1/1) ... [2024-11-12 00:58:17,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633ed159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:17, skipping insertion in model container [2024-11-12 00:58:17,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:17" (1/1) ... [2024-11-12 00:58:17,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:58:17,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-12 00:58:17,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:17,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:58:17,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-12 00:58:17,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:18,022 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:58:18,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18 WrapperNode [2024-11-12 00:58:18,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:18,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:18,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:58:18,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:58:18,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,157 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1083 [2024-11-12 00:58:18,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:18,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:58:18,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:58:18,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:58:18,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,234 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:58:18,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:58:18,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:58:18,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:58:18,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:58:18,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (1/1) ... [2024-11-12 00:58:18,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:58:18,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:58:18,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:58:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:58:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:58:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:58:18,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:58:18,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:58:18,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:58:20,469 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-12 00:58:20,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:58:20,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:58:20,496 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:58:20,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:20 BoogieIcfgContainer [2024-11-12 00:58:20,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:58:20,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:58:20,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:58:20,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:58:20,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:58:17" (1/3) ... [2024-11-12 00:58:20,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36622b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:20, skipping insertion in model container [2024-11-12 00:58:20,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:18" (2/3) ... [2024-11-12 00:58:20,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36622b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:20, skipping insertion in model container [2024-11-12 00:58:20,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:20" (3/3) ... [2024-11-12 00:58:20,514 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-12 00:58:20,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:58:20,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:58:20,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:58:20,606 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;@6e77a28c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:58:20,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:58:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:58:20,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:20,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:58:20,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:58:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455597316] [2024-11-12 00:58:20,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:20,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:20,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:20,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:58:20,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 00:58:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:20,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 00:58:20,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:21,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:58:21,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455597316] [2024-11-12 00:58:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455597316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206318011] [2024-11-12 00:58:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:21,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:21,166 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:21,253 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:58:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 00:58:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:21,263 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:58:21,263 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:58:21,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:58:21,270 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:21,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:58:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:58:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:58:21,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:58:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:21,313 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:58:21,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:58:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:58:21,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:21,314 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:21,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:58:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:21,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:58:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026696074] [2024-11-12 00:58:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:21,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:58:21,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 00:58:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:21,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 00:58:21,927 INFO L279 TraceCheckSpWp]: Computing forward predicates...