./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:59:51,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:59:51,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:59:51,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:59:51,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:59:51,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:59:51,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:59:51,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:59:51,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:59:51,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:59:51,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:59:51,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:59:51,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:59:51,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:59:51,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:59:51,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:59:51,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:59:51,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:59:51,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:59:51,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:59:51,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:59:51,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:59:51,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:59:51,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:59:51,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:59:51,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:59:51,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:59:51,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:59:51,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:59:51,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:51,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:59:51,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:59:51,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:59:51,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:59:51,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:59:51,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:59:51,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:59:51,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:59:51,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:59:51,594 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-16 11:59:51,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:59:51,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:59:51,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:59:51,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:59:51,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:59:51,817 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-16 11:59:53,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:59:53,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:59:53,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-16 11:59:53,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86fed3a2/a2a4d33b91ef48dfa89223598bd72e08/FLAG3346ba5e8 [2024-11-16 11:59:53,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86fed3a2/a2a4d33b91ef48dfa89223598bd72e08 [2024-11-16 11:59:53,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:59:53,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:59:53,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:53,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:59:53,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:59:53,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:53,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fde2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53, skipping insertion in model container [2024-11-16 11:59:53,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:53,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:59:53,485 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-16 11:59:53,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:53,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:59:53,703 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-16 11:59:53,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:53,788 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:59:53,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53 WrapperNode [2024-11-16 11:59:53,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:53,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:53,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:59:53,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:59:53,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:53,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:53,963 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2148 [2024-11-16 11:59:53,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:53,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:59:53,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:59:53,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:59:53,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:53,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,129 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-16 11:59:54,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:59:54,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:59:54,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:59:54,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:59:54,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (1/1) ... [2024-11-16 11:59:54,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:59:54,313 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-16 11:59:54,314 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-16 11:59:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:59:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:59:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:59:54,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:59:54,522 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:59:54,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:59:56,076 INFO L? ?]: Removed 1344 outVars from TransFormulas that were not future-live. [2024-11-16 11:59:56,076 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:59:56,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:59:56,151 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:59:56,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:56 BoogieIcfgContainer [2024-11-16 11:59:56,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:59:56,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:59:56,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:59:56,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:59:56,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:53" (1/3) ... [2024-11-16 11:59:56,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a06875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:56, skipping insertion in model container [2024-11-16 11:59:56,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:53" (2/3) ... [2024-11-16 11:59:56,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a06875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:56, skipping insertion in model container [2024-11-16 11:59:56,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:56" (3/3) ... [2024-11-16 11:59:56,161 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-16 11:59:56,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:59:56,176 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:59:56,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:59:56,245 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;@70ff5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:59:56,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:59:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 11:59:56,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:56,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:56,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -120664922, now seen corresponding path program 1 times [2024-11-16 11:59:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952997157] [2024-11-16 11:59:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:56,783 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-16 11:59:56,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:56,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952997157] [2024-11-16 11:59:56,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952997157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:56,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942931492] [2024-11-16 11:59:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:56,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:56,811 INFO L87 Difference]: Start difference. First operand has 546 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.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-16 11:59:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:57,090 INFO L93 Difference]: Finished difference Result 1035 states and 1547 transitions. [2024-11-16 11:59:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:57,092 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-16 11:59:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:57,105 INFO L225 Difference]: With dead ends: 1035 [2024-11-16 11:59:57,107 INFO L226 Difference]: Without dead ends: 543 [2024-11-16 11:59:57,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:57,113 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:57,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2014 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-16 11:59:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-16 11:59:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4944649446494465) internal successors, (810), 542 states have internal predecessors, (810), 0 states have call successors, (0), 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-16 11:59:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 810 transitions. [2024-11-16 11:59:57,163 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 810 transitions. Word has length 46 [2024-11-16 11:59:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:57,163 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 810 transitions. [2024-11-16 11:59:57,163 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-16 11:59:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 810 transitions. [2024-11-16 11:59:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 11:59:57,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:57,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:57,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:59:57,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:57,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 699408884, now seen corresponding path program 1 times [2024-11-16 11:59:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746638366] [2024-11-16 11:59:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:57,328 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-16 11:59:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746638366] [2024-11-16 11:59:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746638366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731801902] [2024-11-16 11:59:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:57,333 INFO L87 Difference]: Start difference. First operand 543 states and 810 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-16 11:59:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:57,574 INFO L93 Difference]: Finished difference Result 1034 states and 1543 transitions. [2024-11-16 11:59:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:57,575 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-16 11:59:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:57,577 INFO L225 Difference]: With dead ends: 1034 [2024-11-16 11:59:57,577 INFO L226 Difference]: Without dead ends: 545 [2024-11-16 11:59:57,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:57,579 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:57,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2011 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-16 11:59:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2024-11-16 11:59:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4926470588235294) internal successors, (812), 544 states have internal predecessors, (812), 0 states have call successors, (0), 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-16 11:59:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 812 transitions. [2024-11-16 11:59:57,592 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 812 transitions. Word has length 47 [2024-11-16 11:59:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:57,592 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 812 transitions. [2024-11-16 11:59:57,592 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-16 11:59:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 812 transitions. [2024-11-16 11:59:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 11:59:57,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:57,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:57,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:59:57,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:57,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash -45916725, now seen corresponding path program 1 times [2024-11-16 11:59:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847545749] [2024-11-16 11:59:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:57,917 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-16 11:59:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847545749] [2024-11-16 11:59:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847545749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:57,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347072495] [2024-11-16 11:59:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:57,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:57,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:57,922 INFO L87 Difference]: Start difference. First operand 545 states and 812 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:58,177 INFO L93 Difference]: Finished difference Result 1040 states and 1550 transitions. [2024-11-16 11:59:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-16 11:59:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:58,180 INFO L225 Difference]: With dead ends: 1040 [2024-11-16 11:59:58,180 INFO L226 Difference]: Without dead ends: 549 [2024-11-16 11:59:58,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:58,182 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 2 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:58,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2007 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-16 11:59:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2024-11-16 11:59:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4908424908424909) internal successors, (814), 546 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 814 transitions. [2024-11-16 11:59:58,193 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 814 transitions. Word has length 48 [2024-11-16 11:59:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:58,193 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 814 transitions. [2024-11-16 11:59:58,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 814 transitions. [2024-11-16 11:59:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 11:59:58,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:58,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:59:58,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1281245007, now seen corresponding path program 1 times [2024-11-16 11:59:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248019812] [2024-11-16 11:59:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:58,393 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-16 11:59:58,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248019812] [2024-11-16 11:59:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248019812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:58,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:59:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175503252] [2024-11-16 11:59:58,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:59:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:59:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:59:58,395 INFO L87 Difference]: Start difference. First operand 547 states and 814 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-16 11:59:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:58,727 INFO L93 Difference]: Finished difference Result 1044 states and 1554 transitions. [2024-11-16 11:59:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:59:58,727 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-16 11:59:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:58,729 INFO L225 Difference]: With dead ends: 1044 [2024-11-16 11:59:58,729 INFO L226 Difference]: Without dead ends: 551 [2024-11-16 11:59:58,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:59:58,730 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 1 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:58,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3337 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:59:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-16 11:59:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2024-11-16 11:59:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 0 states have call successors, (0), 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-16 11:59:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2024-11-16 11:59:58,737 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 49 [2024-11-16 11:59:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2024-11-16 11:59:58,737 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-16 11:59:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2024-11-16 11:59:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 11:59:58,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:58,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:59:58,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash 92679946, now seen corresponding path program 1 times [2024-11-16 11:59:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104300172] [2024-11-16 11:59:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:58,875 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-16 11:59:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104300172] [2024-11-16 11:59:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104300172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:59:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443791805] [2024-11-16 11:59:58,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:58,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:59:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:59:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:59:58,876 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:59,128 INFO L93 Difference]: Finished difference Result 1052 states and 1565 transitions. [2024-11-16 11:59:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:59:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-16 11:59:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:59,130 INFO L225 Difference]: With dead ends: 1052 [2024-11-16 11:59:59,130 INFO L226 Difference]: Without dead ends: 556 [2024-11-16 11:59:59,131 INFO L431 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-16 11:59:59,131 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 4 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:59,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2678 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-16 11:59:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-16 11:59:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4882882882882882) internal successors, (826), 555 states have internal predecessors, (826), 0 states have call successors, (0), 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-16 11:59:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2024-11-16 11:59:59,138 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 49 [2024-11-16 11:59:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:59,138 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2024-11-16 11:59:59,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2024-11-16 11:59:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 11:59:59,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:59,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:59,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:59:59,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1262963052, now seen corresponding path program 1 times [2024-11-16 11:59:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146637574] [2024-11-16 11:59:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:59,465 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-16 11:59:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146637574] [2024-11-16 11:59:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146637574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 11:59:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364193160] [2024-11-16 11:59:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:59:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:59:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:59:59,469 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:59,874 INFO L93 Difference]: Finished difference Result 1063 states and 1579 transitions. [2024-11-16 11:59:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:59:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-16 11:59:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:59,876 INFO L225 Difference]: With dead ends: 1063 [2024-11-16 11:59:59,876 INFO L226 Difference]: Without dead ends: 561 [2024-11-16 11:59:59,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:59:59,878 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 780 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:59,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 3313 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:59:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-16 11:59:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2024-11-16 11:59:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.486583184257603) internal successors, (831), 559 states have internal predecessors, (831), 0 states have call successors, (0), 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-16 11:59:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 831 transitions. [2024-11-16 11:59:59,884 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 831 transitions. Word has length 50 [2024-11-16 11:59:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:59,885 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 831 transitions. [2024-11-16 11:59:59,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 831 transitions. [2024-11-16 11:59:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 11:59:59,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:59,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:59:59,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -794827467, now seen corresponding path program 1 times [2024-11-16 11:59:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304099335] [2024-11-16 11:59:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:00,074 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-16 12:00:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304099335] [2024-11-16 12:00:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304099335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115233016] [2024-11-16 12:00:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:00,076 INFO L87 Difference]: Start difference. First operand 560 states and 831 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:00,313 INFO L93 Difference]: Finished difference Result 1068 states and 1585 transitions. [2024-11-16 12:00:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:00,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-16 12:00:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:00,316 INFO L225 Difference]: With dead ends: 1068 [2024-11-16 12:00:00,316 INFO L226 Difference]: Without dead ends: 562 [2024-11-16 12:00:00,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:00,317 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 780 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:00,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2002 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-16 12:00:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2024-11-16 12:00:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.4848484848484849) internal successors, (833), 561 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-16 12:00:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 833 transitions. [2024-11-16 12:00:00,323 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 833 transitions. Word has length 50 [2024-11-16 12:00:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:00,324 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 833 transitions. [2024-11-16 12:00:00,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 833 transitions. [2024-11-16 12:00:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 12:00:00,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:00,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:00:00,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:00,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1015216421, now seen corresponding path program 1 times [2024-11-16 12:00:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183048587] [2024-11-16 12:00:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:00,498 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-16 12:00:00,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183048587] [2024-11-16 12:00:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183048587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944285685] [2024-11-16 12:00:00,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:00,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:00,501 INFO L87 Difference]: Start difference. First operand 562 states and 833 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:00,831 INFO L93 Difference]: Finished difference Result 1072 states and 1589 transitions. [2024-11-16 12:00:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-16 12:00:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:00,833 INFO L225 Difference]: With dead ends: 1072 [2024-11-16 12:00:00,833 INFO L226 Difference]: Without dead ends: 564 [2024-11-16 12:00:00,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:00,835 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 778 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1911 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:00:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-16 12:00:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2024-11-16 12:00:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.4848484848484849) internal successors, (833), 561 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-16 12:00:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 833 transitions. [2024-11-16 12:00:00,841 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 833 transitions. Word has length 51 [2024-11-16 12:00:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:00,842 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 833 transitions. [2024-11-16 12:00:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 833 transitions. [2024-11-16 12:00:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 12:00:00,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:00,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:00,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:00:00,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:00,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 795163413, now seen corresponding path program 1 times [2024-11-16 12:00:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058692098] [2024-11-16 12:00:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:00,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:00:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:00,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:00:00,960 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:00:00,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:00:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:00:00,964 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:01,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:00:01,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:01 BoogieIcfgContainer [2024-11-16 12:00:01,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:00:01,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:00:01,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:00:01,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:00:01,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:56" (3/4) ... [2024-11-16 12:00:01,029 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:00:01,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:00:01,031 INFO L158 Benchmark]: Toolchain (without parser) took 7818.50ms. Allocated memory was 172.0MB in the beginning and 457.2MB in the end (delta: 285.2MB). Free memory was 101.2MB in the beginning and 306.1MB in the end (delta: -204.9MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,031 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:01,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.35ms. Allocated memory is still 172.0MB. Free memory was 100.9MB in the beginning and 103.4MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 174.19ms. Allocated memory is still 172.0MB. Free memory was 103.4MB in the beginning and 53.7MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,032 INFO L158 Benchmark]: Boogie Preprocessor took 320.59ms. Allocated memory is still 172.0MB. Free memory was 53.7MB in the beginning and 109.0MB in the end (delta: -55.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,033 INFO L158 Benchmark]: IcfgBuilder took 1867.89ms. Allocated memory was 172.0MB in the beginning and 318.8MB in the end (delta: 146.8MB). Free memory was 109.0MB in the beginning and 191.2MB in the end (delta: -82.2MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,033 INFO L158 Benchmark]: TraceAbstraction took 4870.57ms. Allocated memory was 318.8MB in the beginning and 457.2MB in the end (delta: 138.4MB). Free memory was 191.2MB in the beginning and 307.2MB in the end (delta: -115.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-16 12:00:01,034 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 457.2MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:01,035 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.35ms. Allocated memory is still 172.0MB. Free memory was 100.9MB in the beginning and 103.4MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 174.19ms. Allocated memory is still 172.0MB. Free memory was 103.4MB in the beginning and 53.7MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 320.59ms. Allocated memory is still 172.0MB. Free memory was 53.7MB in the beginning and 109.0MB in the end (delta: -55.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1867.89ms. Allocated memory was 172.0MB in the beginning and 318.8MB in the end (delta: 146.8MB). Free memory was 109.0MB in the beginning and 191.2MB in the end (delta: -82.2MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4870.57ms. Allocated memory was 318.8MB in the beginning and 457.2MB in the end (delta: 138.4MB). Free memory was 191.2MB in the beginning and 307.2MB in the end (delta: -115.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 457.2MB. Free memory is still 306.1MB. 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, 546 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2345 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2345 mSDsluCounter, 19273 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13940 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4157 IncrementalHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 5333 mSDtfsCounter, 4157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=7, InterpolantAutomatonStates: 41, 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, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 382 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-16 12:00:01,066 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:02,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:03,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 12:00:03,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:03,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:03,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:03,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:03,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:03,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:03,034 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:03,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:03,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:03,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:03,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:03,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:03,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:03,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:03,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:03,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:03,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:03,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:03,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:00:03,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:00:03,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:03,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:00:03,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:03,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:03,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:03,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:03,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:03,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:03,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:03,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:03,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:03,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:03,042 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:00:03,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:00:03,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:03,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:03,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:03,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:03,044 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-16 12:00:03,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:03,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:03,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:03,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:03,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:03,315 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-16 12:00:04,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:04,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:04,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-16 12:00:04,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa8c90e5/bc32765ae45149cf9f564dfdda62216e/FLAG5b2cb3d9b [2024-11-16 12:00:05,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa8c90e5/bc32765ae45149cf9f564dfdda62216e [2024-11-16 12:00:05,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:05,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:05,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:05,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:05,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:05,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2152d8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05, skipping insertion in model container [2024-11-16 12:00:05,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:05,389 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-16 12:00:05,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:05,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:05,645 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-16 12:00:05,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:05,747 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:05,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05 WrapperNode [2024-11-16 12:00:05,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:05,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:05,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:05,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:05,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,881 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-11-16 12:00:05,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:05,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:05,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:05,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:05,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,938 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-16 12:00:05,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:05,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:05,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:05,995 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:05,995 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:05,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (1/1) ... [2024-11-16 12:00:06,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:06,032 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-16 12:00:06,035 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-16 12:00:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:00:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:06,370 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:06,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:07,457 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:07,457 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:07,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:07,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:07,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:07 BoogieIcfgContainer [2024-11-16 12:00:07,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:07,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:07,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:07,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:07,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:05" (1/3) ... [2024-11-16 12:00:07,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f62e3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:07, skipping insertion in model container [2024-11-16 12:00:07,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:05" (2/3) ... [2024-11-16 12:00:07,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f62e3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:07, skipping insertion in model container [2024-11-16 12:00:07,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:07" (3/3) ... [2024-11-16 12:00:07,477 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-16 12:00:07,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:07,491 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:07,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:07,538 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;@aeafefe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:07,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 12:00:07,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:07,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 12:00:07,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:07,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 12:00:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829315027] [2024-11-16 12:00:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:07,570 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-16 12:00:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:07,572 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-16 12:00:07,589 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-16 12:00:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:07,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 12:00:07,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:07,944 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-16 12:00:07,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:07,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829315027] [2024-11-16 12:00:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829315027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:07,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687520869] [2024-11-16 12:00:07,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:07,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:07,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:07,975 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:08,046 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 12:00:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 12:00:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:08,058 INFO L225 Difference]: With dead ends: 22 [2024-11-16 12:00:08,058 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 12:00:08,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:08,064 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:08,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 12:00:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 12:00:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 12:00:08,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 12:00:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 12:00:08,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 12:00:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 12:00:08,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:08,098 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:08,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:00:08,298 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-16 12:00:08,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:08,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 12:00:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927868243] [2024-11-16 12:00:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:08,302 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-16 12:00:08,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:08,304 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-16 12:00:08,305 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-16 12:00:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:08,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 12:00:08,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:08,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:09,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927868243] [2024-11-16 12:00:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927868243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:09,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:00:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 12:00:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035873918] [2024-11-16 12:00:09,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:00:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:00:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:00:09,162 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:09,818 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-16 12:00:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:00:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 12:00:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:09,819 INFO L225 Difference]: With dead ends: 20 [2024-11-16 12:00:09,820 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 12:00:09,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:00:09,821 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:09,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:00:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 12:00:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-16 12:00:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 12:00:09,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-16 12:00:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:09,829 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 12:00:09,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 12:00:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 12:00:09,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:09,830 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 12:00:09,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:00:10,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:10,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:10,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-16 12:00:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854210720] [2024-11-16 12:00:10,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 12:00:10,034 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-16 12:00:10,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:10,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:00:10,701 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 12:00:10,701 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 12:00:10,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 12:00:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:10,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:11,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854210720] [2024-11-16 12:00:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854210720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:11,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:00:11,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-16 12:00:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871807456] [2024-11-16 12:00:11,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:11,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:00:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:00:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:00:11,678 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:12,443 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-16 12:00:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 12:00:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 12:00:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:12,444 INFO L225 Difference]: With dead ends: 35 [2024-11-16 12:00:12,444 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 12:00:12,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-16 12:00:12,445 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:12,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:00:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 12:00:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-16 12:00:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 12:00:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-16 12:00:12,451 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2024-11-16 12:00:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-16 12:00:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-16 12:00:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 12:00:12,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:12,452 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2024-11-16 12:00:12,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 12:00:12,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:12,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:12,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1651905795, now seen corresponding path program 3 times [2024-11-16 12:00:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637729073] [2024-11-16 12:00:12,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 12:00:12,655 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-16 12:00:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:12,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:12,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 12:00:13,525 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-16 12:00:13,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 12:00:13,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-16 12:00:13,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...