./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.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 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:21:07,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:21:08,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-20 00:21:08,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:21:08,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:21:08,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:21:08,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:21:08,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:21:08,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:21:08,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:21:08,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:21:08,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:21:08,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:21:08,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:21:08,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:21:08,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:21:08,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:21:08,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:21:08,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:21:08,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:21:08,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:21:08,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:21:08,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:21:08,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:21:08,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:21:08,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:21:08,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:21:08,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:21:08,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:21:08,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:21:08,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:21:08,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:21:08,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:21:08,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:21:08,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:21:08,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:21:08,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:21:08,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:21:08,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:21:08,118 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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2024-11-20 00:21:08,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:21:08,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:21:08,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:21:08,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:21:08,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:21:08,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:09,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:21:10,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:21:10,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:10,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/550c036f8/9594d7dcc89e4f7ba4ee63ba3f513246/FLAG515d8faf5 [2024-11-20 00:21:10,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/550c036f8/9594d7dcc89e4f7ba4ee63ba3f513246 [2024-11-20 00:21:10,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:21:10,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:21:10,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:21:10,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:21:10,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:21:10,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:10" (1/1) ... [2024-11-20 00:21:10,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101e739d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:10, skipping insertion in model container [2024-11-20 00:21:10,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:10" (1/1) ... [2024-11-20 00:21:10,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:21:10,739 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.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-20 00:21:11,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:21:11,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:21:11,057 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.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-20 00:21:11,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:21:11,190 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:21:11,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11 WrapperNode [2024-11-20 00:21:11,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:21:11,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:21:11,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:21:11,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:21:11,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:11,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:11,909 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4638 [2024-11-20 00:21:11,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:21:11,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:21:11,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:21:11,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:21:11,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:11,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,206 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-20 00:21:12,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:21:12,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:21:12,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:21:12,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:21:12,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (1/1) ... [2024-11-20 00:21:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:21:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:21:12,633 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-20 00:21:12,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 00:21:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:21:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:21:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:21:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:21:13,089 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:21:13,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:21:17,833 INFO L? ?]: Removed 2538 outVars from TransFormulas that were not future-live. [2024-11-20 00:21:17,834 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:21:17,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:21:17,871 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 00:21:17,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:17 BoogieIcfgContainer [2024-11-20 00:21:17,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:21:17,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:21:17,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:21:17,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:21:17,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:21:10" (1/3) ... [2024-11-20 00:21:17,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4daee392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:17, skipping insertion in model container [2024-11-20 00:21:17,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:11" (2/3) ... [2024-11-20 00:21:17,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4daee392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:17, skipping insertion in model container [2024-11-20 00:21:17,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:17" (3/3) ... [2024-11-20 00:21:17,883 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:17,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:21:17,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 00:21:18,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:21:18,013 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;@562b2e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:21:18,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 00:21:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 1632 states, 1630 states have (on average 1.503680981595092) internal successors, (2451), 1631 states have internal predecessors, (2451), 0 states have call successors, (0), 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-20 00:21:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 00:21:18,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:18,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:18,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash 456195606, now seen corresponding path program 1 times [2024-11-20 00:21:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040191640] [2024-11-20 00:21:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:18,825 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-20 00:21:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040191640] [2024-11-20 00:21:18,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040191640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:18,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:18,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:21:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289325158] [2024-11-20 00:21:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:21:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:21:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:21:18,864 INFO L87 Difference]: Start difference. First operand has 1632 states, 1630 states have (on average 1.503680981595092) internal successors, (2451), 1631 states have internal predecessors, (2451), 0 states have call successors, (0), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-20 00:21:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:19,029 INFO L93 Difference]: Finished difference Result 3169 states and 4763 transitions. [2024-11-20 00:21:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:21:19,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-20 00:21:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:19,050 INFO L225 Difference]: With dead ends: 3169 [2024-11-20 00:21:19,050 INFO L226 Difference]: Without dead ends: 1631 [2024-11-20 00:21:19,058 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-20 00:21:19,061 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4884 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7329 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:19,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7329 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:21:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-11-20 00:21:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-11-20 00:21:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 1.5024539877300613) internal successors, (2449), 1630 states have internal predecessors, (2449), 0 states have call successors, (0), 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-20 00:21:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2449 transitions. [2024-11-20 00:21:19,163 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2449 transitions. Word has length 79 [2024-11-20 00:21:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:19,164 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2449 transitions. [2024-11-20 00:21:19,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-20 00:21:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2449 transitions. [2024-11-20 00:21:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 00:21:19,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:19,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:19,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:21:19,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:19,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1258857532, now seen corresponding path program 1 times [2024-11-20 00:21:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449558935] [2024-11-20 00:21:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:21:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449558935] [2024-11-20 00:21:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449558935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:21:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578524780] [2024-11-20 00:21:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:19,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:21:19,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:19,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:21:19,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:21:19,516 INFO L87 Difference]: Start difference. First operand 1631 states and 2449 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 00:21:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:19,588 INFO L93 Difference]: Finished difference Result 3170 states and 4761 transitions. [2024-11-20 00:21:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:21:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-20 00:21:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:19,595 INFO L225 Difference]: With dead ends: 3170 [2024-11-20 00:21:19,595 INFO L226 Difference]: Without dead ends: 1633 [2024-11-20 00:21:19,598 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-20 00:21:19,600 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4880 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7325 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:19,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7325 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:21:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-20 00:21:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2024-11-20 00:21:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.5018382352941178) internal successors, (2451), 1632 states have internal predecessors, (2451), 0 states have call successors, (0), 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-20 00:21:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2451 transitions. [2024-11-20 00:21:19,632 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2451 transitions. Word has length 80 [2024-11-20 00:21:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:19,634 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2451 transitions. [2024-11-20 00:21:19,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-20 00:21:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2451 transitions. [2024-11-20 00:21:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 00:21:19,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:19,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:21:19,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -728087633, now seen corresponding path program 1 times [2024-11-20 00:21:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995087197] [2024-11-20 00:21:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:19,855 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-20 00:21:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995087197] [2024-11-20 00:21:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995087197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:21:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380823717] [2024-11-20 00:21:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:21:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:21:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:21:19,861 INFO L87 Difference]: Start difference. First operand 1633 states and 2451 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 00:21:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:19,936 INFO L93 Difference]: Finished difference Result 3174 states and 4765 transitions. [2024-11-20 00:21:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:21:19,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-20 00:21:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:19,945 INFO L225 Difference]: With dead ends: 3174 [2024-11-20 00:21:19,945 INFO L226 Difference]: Without dead ends: 1635 [2024-11-20 00:21:19,948 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-20 00:21:19,950 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7319 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:19,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:21:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-20 00:21:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2024-11-20 00:21:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1634 states have (on average 1.5012239902080784) internal successors, (2453), 1634 states have internal predecessors, (2453), 0 states have call successors, (0), 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-20 00:21:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2453 transitions. [2024-11-20 00:21:19,988 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2453 transitions. Word has length 81 [2024-11-20 00:21:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:19,988 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2453 transitions. [2024-11-20 00:21:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-20 00:21:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2453 transitions. [2024-11-20 00:21:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 00:21:19,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:19,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:21:19,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -186992861, now seen corresponding path program 1 times [2024-11-20 00:21:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250783020] [2024-11-20 00:21:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:20,264 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-20 00:21:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250783020] [2024-11-20 00:21:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250783020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:21:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267895743] [2024-11-20 00:21:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:21:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:21:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:21:20,269 INFO L87 Difference]: Start difference. First operand 1635 states and 2453 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 00:21:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:20,337 INFO L93 Difference]: Finished difference Result 3184 states and 4777 transitions. [2024-11-20 00:21:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:21:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-20 00:21:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:20,344 INFO L225 Difference]: With dead ends: 3184 [2024-11-20 00:21:20,344 INFO L226 Difference]: Without dead ends: 1643 [2024-11-20 00:21:20,346 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-20 00:21:20,349 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 3 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 7319 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:20,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 7319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:21:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-20 00:21:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1639. [2024-11-20 00:21:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1638 states have (on average 1.5012210012210012) internal successors, (2459), 1638 states have internal predecessors, (2459), 0 states have call successors, (0), 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-20 00:21:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2459 transitions. [2024-11-20 00:21:20,381 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2459 transitions. Word has length 82 [2024-11-20 00:21:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:20,382 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2459 transitions. [2024-11-20 00:21:20,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 00:21:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2459 transitions. [2024-11-20 00:21:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 00:21:20,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:20,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:20,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:21:20,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -387617720, now seen corresponding path program 1 times [2024-11-20 00:21:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718342676] [2024-11-20 00:21:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:20,689 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-20 00:21:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718342676] [2024-11-20 00:21:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718342676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:21:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342443644] [2024-11-20 00:21:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:20,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:21:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:21:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:21:20,696 INFO L87 Difference]: Start difference. First operand 1639 states and 2459 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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-20 00:21:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:22,606 INFO L93 Difference]: Finished difference Result 4713 states and 7073 transitions. [2024-11-20 00:21:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:21:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-20 00:21:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:22,619 INFO L225 Difference]: With dead ends: 4713 [2024-11-20 00:21:22,619 INFO L226 Difference]: Without dead ends: 3168 [2024-11-20 00:21:22,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:21:22,623 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2359 mSDsluCounter, 5584 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 7480 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:22,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 7480 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 00:21:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2024-11-20 00:21:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 1682. [2024-11-20 00:21:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.5002974419988102) internal successors, (2522), 1681 states have internal predecessors, (2522), 0 states have call successors, (0), 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-20 00:21:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2522 transitions. [2024-11-20 00:21:22,667 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2522 transitions. Word has length 83 [2024-11-20 00:21:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:22,667 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2522 transitions. [2024-11-20 00:21:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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-20 00:21:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2522 transitions. [2024-11-20 00:21:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:21:22,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:22,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:22,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:21:22,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:22,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1102737222, now seen corresponding path program 1 times [2024-11-20 00:21:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72054451] [2024-11-20 00:21:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:23,132 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-20 00:21:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:21:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72054451] [2024-11-20 00:21:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72054451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:21:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709295064] [2024-11-20 00:21:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:21:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:21:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:21:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:21:23,136 INFO L87 Difference]: Start difference. First operand 1682 states and 2522 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-20 00:21:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:24,600 INFO L93 Difference]: Finished difference Result 3242 states and 4862 transitions. [2024-11-20 00:21:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:21:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-20 00:21:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:24,608 INFO L225 Difference]: With dead ends: 3242 [2024-11-20 00:21:24,609 INFO L226 Difference]: Without dead ends: 1697 [2024-11-20 00:21:24,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:21:24,612 INFO L432 NwaCegarLoop]: 1877 mSDtfsCounter, 2392 mSDsluCounter, 5617 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 7494 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:24,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 7494 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:21:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-11-20 00:21:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2024-11-20 00:21:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.4976387249114522) internal successors, (2537), 1694 states have internal predecessors, (2537), 0 states have call successors, (0), 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-20 00:21:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2537 transitions. [2024-11-20 00:21:24,649 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2537 transitions. Word has length 84 [2024-11-20 00:21:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:24,650 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2537 transitions. [2024-11-20 00:21:24,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-20 00:21:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2537 transitions. [2024-11-20 00:21:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 00:21:24,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:24,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:21:24,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:21:24,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:24,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 144462281, now seen corresponding path program 1 times [2024-11-20 00:21:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:21:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749568644] [2024-11-20 00:21:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:21:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 00:21:24,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 00:21:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 00:21:24,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 00:21:24,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 00:21:24,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 00:21:24,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:21:24,861 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:21:24,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 00:21:24,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:21:24 BoogieIcfgContainer [2024-11-20 00:21:24,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 00:21:24,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 00:21:24,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 00:21:24,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 00:21:24,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:17" (3/4) ... [2024-11-20 00:21:24,956 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 00:21:24,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 00:21:24,957 INFO L158 Benchmark]: Toolchain (without parser) took 14551.57ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 97.7MB in the beginning and 856.5MB in the end (delta: -758.8MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,958 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 128.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 00:21:24,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.13ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 84.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 716.72ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 84.7MB in the beginning and 152.1MB in the end (delta: -67.4MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,959 INFO L158 Benchmark]: Boogie Preprocessor took 684.34ms. Allocated memory is still 251.7MB. Free memory was 152.1MB in the beginning and 100.0MB in the end (delta: 52.1MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,959 INFO L158 Benchmark]: RCFGBuilder took 5276.30ms. Allocated memory was 251.7MB in the beginning and 704.6MB in the end (delta: 453.0MB). Free memory was 100.0MB in the beginning and 498.2MB in the end (delta: -398.2MB). Peak memory consumption was 237.7MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,959 INFO L158 Benchmark]: TraceAbstraction took 7076.15ms. Allocated memory was 704.6MB in the beginning and 1.0GB in the end (delta: 304.1MB). Free memory was 498.2MB in the beginning and 857.5MB in the end (delta: -359.3MB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. [2024-11-20 00:21:24,960 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 1.0GB. Free memory was 857.5MB in the beginning and 856.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 00:21:24,961 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.51ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 128.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.13ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 84.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 716.72ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 84.7MB in the beginning and 152.1MB in the end (delta: -67.4MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 684.34ms. Allocated memory is still 251.7MB. Free memory was 152.1MB in the beginning and 100.0MB in the end (delta: 52.1MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5276.30ms. Allocated memory was 251.7MB in the beginning and 704.6MB in the end (delta: 453.0MB). Free memory was 100.0MB in the beginning and 498.2MB in the end (delta: -398.2MB). Peak memory consumption was 237.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7076.15ms. Allocated memory was 704.6MB in the beginning and 1.0GB in the end (delta: 304.1MB). Free memory was 498.2MB in the beginning and 857.5MB in the end (delta: -359.3MB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 1.0GB. Free memory was 857.5MB in the beginning and 856.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 194. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_20 = 0; [L40] const SORT_4 var_53 = 1; [L41] const SORT_4 var_54 = 0; [L42] const SORT_2 var_63 = 1; [L43] const SORT_3 var_65 = 0; [L44] const SORT_4 var_68 = 3; [L45] const SORT_2 var_72 = 0; [L46] const SORT_4 var_122 = 2; [L47] const SORT_2 var_125 = 2; [L49] SORT_1 input_64; [L50] SORT_1 input_74; [L51] SORT_1 input_76; [L52] SORT_1 input_83; [L53] SORT_1 input_85; [L54] SORT_1 input_92; [L55] SORT_1 input_143; [L56] SORT_1 input_147; [L57] SORT_1 input_150; [L58] SORT_1 input_151; [L59] SORT_1 input_152; [L60] SORT_1 input_153; [L61] SORT_1 input_161; [L62] SORT_1 input_167; [L63] SORT_1 input_173; [L64] SORT_1 input_188; [L65] SORT_1 input_206; [L66] SORT_1 input_224; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L68] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L69] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L70] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L71] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L72] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L73] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L74] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L75] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L76] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L78] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L79] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L80] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L81] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L82] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L83] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L84] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L85] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L86] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L87] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L88] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L89] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L90] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_2 init_7_arg_1 = var_5; [L93] state_6 = init_7_arg_1 [L94] SORT_2 init_9_arg_1 = var_5; [L95] state_8 = init_9_arg_1 [L96] SORT_2 init_11_arg_1 = var_5; [L97] state_10 = init_11_arg_1 [L98] SORT_2 init_13_arg_1 = var_5; [L99] state_12 = init_13_arg_1 [L100] SORT_2 init_15_arg_1 = var_5; [L101] state_14 = init_15_arg_1 [L102] SORT_2 init_17_arg_1 = var_5; [L103] state_16 = init_17_arg_1 [L104] SORT_2 init_19_arg_1 = var_5; [L105] state_18 = init_19_arg_1 [L106] SORT_1 init_22_arg_1 = var_20; [L107] state_21 = init_22_arg_1 [L108] SORT_1 init_24_arg_1 = var_20; [L109] state_23 = init_24_arg_1 [L110] SORT_1 init_26_arg_1 = var_20; [L111] state_25 = init_26_arg_1 [L112] SORT_1 init_28_arg_1 = var_20; [L113] state_27 = init_28_arg_1 [L114] SORT_1 init_30_arg_1 = var_20; [L115] state_29 = init_30_arg_1 [L116] SORT_1 init_32_arg_1 = var_20; [L117] state_31 = init_32_arg_1 [L118] SORT_1 init_34_arg_1 = var_20; [L119] state_33 = init_34_arg_1 [L120] SORT_1 init_36_arg_1 = var_20; [L121] state_35 = init_36_arg_1 [L122] SORT_1 init_38_arg_1 = var_20; [L123] state_37 = init_38_arg_1 [L124] SORT_1 init_40_arg_1 = var_20; [L125] state_39 = init_40_arg_1 [L126] SORT_1 init_42_arg_1 = var_20; [L127] state_41 = init_42_arg_1 [L128] SORT_1 init_44_arg_1 = var_20; [L129] state_43 = init_44_arg_1 [L130] SORT_1 init_46_arg_1 = var_20; [L131] state_45 = init_46_arg_1 [L132] SORT_1 init_48_arg_1 = var_20; [L133] state_47 = init_48_arg_1 [L134] SORT_1 init_50_arg_1 = var_20; [L135] state_49 = init_50_arg_1 [L136] SORT_1 init_52_arg_1 = var_20; [L137] state_51 = init_52_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L140] input_64 = __VERIFIER_nondet_uchar() [L141] input_74 = __VERIFIER_nondet_uchar() [L142] input_76 = __VERIFIER_nondet_uchar() [L143] input_83 = __VERIFIER_nondet_uchar() [L144] input_85 = __VERIFIER_nondet_uchar() [L145] input_92 = __VERIFIER_nondet_uchar() [L146] input_143 = __VERIFIER_nondet_uchar() [L147] EXPR input_143 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L147] input_143 = input_143 & mask_SORT_1 [L148] input_147 = __VERIFIER_nondet_uchar() [L149] EXPR input_147 & mask_SORT_1 VAL [input_143=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L149] input_147 = input_147 & mask_SORT_1 [L150] input_150 = __VERIFIER_nondet_uchar() [L151] EXPR input_150 & mask_SORT_1 VAL [input_143=0, input_147=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L151] input_150 = input_150 & mask_SORT_1 [L152] input_151 = __VERIFIER_nondet_uchar() [L153] EXPR input_151 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L153] input_151 = input_151 & mask_SORT_1 [L154] input_152 = __VERIFIER_nondet_uchar() [L155] EXPR input_152 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L155] input_152 = input_152 & mask_SORT_1 [L156] input_153 = __VERIFIER_nondet_uchar() [L157] EXPR input_153 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L157] input_153 = input_153 & mask_SORT_1 [L158] input_161 = __VERIFIER_nondet_uchar() [L159] EXPR input_161 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L159] input_161 = input_161 & mask_SORT_1 [L160] input_167 = __VERIFIER_nondet_uchar() [L161] EXPR input_167 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L161] input_167 = input_167 & mask_SORT_1 [L162] input_173 = __VERIFIER_nondet_uchar() [L163] EXPR input_173 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L163] input_173 = input_173 & mask_SORT_1 [L164] input_188 = __VERIFIER_nondet_uchar() [L165] input_206 = __VERIFIER_nondet_uchar() [L166] input_224 = __VERIFIER_nondet_uchar() [L169] SORT_1 var_55_arg_0 = state_29; [L170] SORT_4 var_55_arg_1 = var_53; [L171] SORT_4 var_55_arg_2 = var_54; [L172] SORT_4 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L173] SORT_1 var_56_arg_0 = state_39; [L174] SORT_4 var_56_arg_1 = var_53; [L175] SORT_4 var_56_arg_2 = var_54; [L176] SORT_4 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L177] SORT_4 var_57_arg_0 = var_55; [L178] SORT_4 var_57_arg_1 = var_56; [L179] SORT_4 var_57 = var_57_arg_0 + var_57_arg_1; [L180] SORT_1 var_58_arg_0 = state_49; [L181] SORT_4 var_58_arg_1 = var_53; [L182] SORT_4 var_58_arg_2 = var_54; [L183] SORT_4 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L184] SORT_4 var_59_arg_0 = var_57; [L185] SORT_4 var_59_arg_1 = var_58; [L186] SORT_4 var_59 = var_59_arg_0 + var_59_arg_1; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_59=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] EXPR var_59 & mask_SORT_4 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] var_59 = var_59 & mask_SORT_4 [L188] SORT_4 var_60_arg_0 = var_59; [L189] SORT_4 var_60_arg_1 = var_53; [L190] SORT_1 var_60 = var_60_arg_0 <= var_60_arg_1; [L191] SORT_1 var_61_arg_0 = ~state_51; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_61_arg_0=-1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] EXPR var_61_arg_0 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] var_61_arg_0 = var_61_arg_0 & mask_SORT_1 [L193] SORT_1 var_61_arg_1 = ~var_60; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_61_arg_1=-2, var_63=1, var_65=0, var_68=3, var_72=0] [L194] EXPR var_61_arg_1 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_63=1, var_65=0, var_68=3, var_72=0] [L194] var_61_arg_1 = var_61_arg_1 & mask_SORT_1 [L195] EXPR var_61_arg_0 & var_61_arg_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L195] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L196] EXPR var_61 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L196] var_61 = var_61 & mask_SORT_1 [L197] SORT_1 bad_62_arg_0 = var_61; [L198] CALL __VERIFIER_assert(!(bad_62_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1632 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4754 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4754 mSDsluCounter, 44266 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30713 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4530 IncrementalHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13553 mSDtfsCounter, 4530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1492 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-20 00:21:24,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.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 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:21:27,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:21:27,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-20 00:21:27,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:21:27,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:21:27,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:21:27,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:21:27,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:21:27,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:21:27,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:21:27,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:21:27,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:21:27,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:21:27,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:21:27,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:21:27,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:21:27,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:21:27,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:21:27,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:21:27,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:21:27,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:21:27,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 00:21:27,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 00:21:27,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:21:27,467 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 00:21:27,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:21:27,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:21:27,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:21:27,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:21:27,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:21:27,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:21:27,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:21:27,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:21:27,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:21:27,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:21:27,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 00:21:27,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 00:21:27,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:21:27,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:21:27,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:21:27,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:21:27,483 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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2024-11-20 00:21:27,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:21:27,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:21:27,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:21:27,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:21:27,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:21:27,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:29,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:21:29,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:21:29,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:29,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e4d4148/f42744fa307243f3900832ca5bb3d2fe/FLAG4e7a3c763 [2024-11-20 00:21:29,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e4d4148/f42744fa307243f3900832ca5bb3d2fe [2024-11-20 00:21:29,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:21:29,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:21:29,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:21:29,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:21:29,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:21:29,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:29" (1/1) ... [2024-11-20 00:21:29,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423daa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:29, skipping insertion in model container [2024-11-20 00:21:29,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:29" (1/1) ... [2024-11-20 00:21:29,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:21:29,977 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.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-20 00:21:30,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:21:30,315 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:21:30,326 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.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-20 00:21:30,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:21:30,441 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:21:30,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30 WrapperNode [2024-11-20 00:21:30,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:21:30,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:21:30,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:21:30,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:21:30,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,579 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1370 [2024-11-20 00:21:30,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:21:30,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:21:30,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:21:30,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:21:30,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,680 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-20 00:21:30,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:21:30,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:21:30,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:21:30,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:21:30,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (1/1) ... [2024-11-20 00:21:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:21:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:21:30,812 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-20 00:21:30,815 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-20 00:21:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:21:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 00:21:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:21:30,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:21:31,232 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:21:31,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:21:33,406 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-20 00:21:33,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:21:33,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:21:33,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 00:21:33,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:33 BoogieIcfgContainer [2024-11-20 00:21:33,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:21:33,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:21:33,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:21:33,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:21:33,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:21:29" (1/3) ... [2024-11-20 00:21:33,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec54777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:33, skipping insertion in model container [2024-11-20 00:21:33,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:30" (2/3) ... [2024-11-20 00:21:33,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec54777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:33, skipping insertion in model container [2024-11-20 00:21:33,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:33" (3/3) ... [2024-11-20 00:21:33,425 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-20 00:21:33,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:21:33,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 00:21:33,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:21:33,507 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;@50ae3fcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:21:33,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 00:21:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:21:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 00:21:33,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:33,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 00:21:33,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-20 00:21:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 00:21:33,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653878256] [2024-11-20 00:21:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:33,539 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-20 00:21:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 00:21:33,542 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-20 00:21:33,564 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-20 00:21:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:33,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 00:21:33,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:21:34,285 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-20 00:21:34,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:21:34,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 00:21:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653878256] [2024-11-20 00:21:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653878256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:21:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:21:34,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 00:21:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270037765] [2024-11-20 00:21:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:21:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:21:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 00:21:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:21:34,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 00:21:34,333 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:21:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:21:35,011 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-20 00:21:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 00:21:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 00:21:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:21:35,022 INFO L225 Difference]: With dead ends: 18 [2024-11-20 00:21:35,023 INFO L226 Difference]: Without dead ends: 10 [2024-11-20 00:21:35,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:21:35,031 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:21:35,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:21:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-20 00:21:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-20 00:21:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:21:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-20 00:21:35,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-20 00:21:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:21:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-20 00:21:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:21:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-20 00:21:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 00:21:35,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:21:35,060 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 00:21:35,064 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-20 00:21:35,261 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-20 00:21:35,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:21:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:21:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-20 00:21:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 00:21:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491309192] [2024-11-20 00:21:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:21:35,265 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-20 00:21:35,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 00:21:35,268 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-20 00:21:35,269 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-20 00:21:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:21:36,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-20 00:21:36,055 INFO L278 TraceCheckSpWp]: Computing forward predicates...