./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.vis_arrays_am2910_p2.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 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:10:32,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:10:32,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:10:32,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:10:32,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:10:32,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:10:32,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:10:32,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:10:32,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:10:32,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:10:32,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:10:32,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:10:32,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:10:32,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:10:32,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:10:32,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:10:32,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:10:32,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:10:32,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:10:32,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:10:32,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:10:32,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:10:32,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:10:32,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:10:32,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:10:32,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:10:32,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:10:32,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:10:32,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:10:32,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:32,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:10:32,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:10:32,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:10:32,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:10:32,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:10:32,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:10:32,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:10:32,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:10:32,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:10:32,574 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 -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-10-14 07:10:32,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:10:32,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:10:32,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:10:32,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:10:32,807 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:10:32,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:34,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:10:34,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:10:34,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:34,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ec9bc92/905c619f79b0422e99c1a6c20f57cedf/FLAGc5d12c83e [2024-10-14 07:10:34,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ec9bc92/905c619f79b0422e99c1a6c20f57cedf [2024-10-14 07:10:34,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:10:34,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:10:34,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:34,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:10:34,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:10:34,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4dfdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34, skipping insertion in model container [2024-10-14 07:10:34,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:10:34,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c[1260,1273] [2024-10-14 07:10:34,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:34,702 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:10:34,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c[1260,1273] [2024-10-14 07:10:34,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:34,834 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:10:34,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34 WrapperNode [2024-10-14 07:10:34,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:34,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:34,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:10:34,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:10:34,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,934 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 607 [2024-10-14 07:10:34,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:34,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:10:34,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:10:34,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:10:34,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:34,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:10:35,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:10:35,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:10:35,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:10:35,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:10:35,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (1/1) ... [2024-10-14 07:10:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:35,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:35,076 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-10-14 07:10:35,081 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-10-14 07:10:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:10:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:10:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:10:35,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:10:35,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:10:35,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:10:35,768 INFO L? ?]: Removed 331 outVars from TransFormulas that were not future-live. [2024-10-14 07:10:35,768 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:10:35,797 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:10:35,797 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:10:35,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:10:35 BoogieIcfgContainer [2024-10-14 07:10:35,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:10:35,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:10:35,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:10:35,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:10:35,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:10:34" (1/3) ... [2024-10-14 07:10:35,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215bf67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:10:35, skipping insertion in model container [2024-10-14 07:10:35,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:34" (2/3) ... [2024-10-14 07:10:35,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215bf67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:10:35, skipping insertion in model container [2024-10-14 07:10:35,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:10:35" (3/3) ... [2024-10-14 07:10:35,806 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:35,820 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:10:35,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:10:35,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:10:35,878 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;@24834334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:10:35,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:10:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 146 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 07:10:35,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:35,896 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] [2024-10-14 07:10:35,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1081087737, now seen corresponding path program 1 times [2024-10-14 07:10:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108464486] [2024-10-14 07:10:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:36,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:36,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108464486] [2024-10-14 07:10:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108464486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:36,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:10:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146797733] [2024-10-14 07:10:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:10:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:10:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:36,426 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 146 states have internal predecessors, (218), 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 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:36,478 INFO L93 Difference]: Finished difference Result 278 states and 414 transitions. [2024-10-14 07:10:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:10:36,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-10-14 07:10:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:36,487 INFO L225 Difference]: With dead ends: 278 [2024-10-14 07:10:36,487 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 07:10:36,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:36,493 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:36,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 634 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 07:10:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-14 07:10:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-14 07:10:36,535 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 22 [2024-10-14 07:10:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:36,535 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-14 07:10:36,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-14 07:10:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 07:10:36,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:36,538 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] [2024-10-14 07:10:36,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:10:36,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 847713791, now seen corresponding path program 1 times [2024-10-14 07:10:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:36,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653548757] [2024-10-14 07:10:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653548757] [2024-10-14 07:10:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653548757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:36,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:36,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:10:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781908999] [2024-10-14 07:10:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:10:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:10:36,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:36,680 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:36,730 INFO L93 Difference]: Finished difference Result 281 states and 414 transitions. [2024-10-14 07:10:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:10:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-10-14 07:10:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:36,732 INFO L225 Difference]: With dead ends: 281 [2024-10-14 07:10:36,732 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 07:10:36,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:36,733 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:36,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 07:10:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-14 07:10:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-10-14 07:10:36,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 23 [2024-10-14 07:10:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:36,745 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-10-14 07:10:36,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-10-14 07:10:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 07:10:36,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:36,746 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] [2024-10-14 07:10:36,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:10:36,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -588642080, now seen corresponding path program 1 times [2024-10-14 07:10:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750995746] [2024-10-14 07:10:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750995746] [2024-10-14 07:10:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750995746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:10:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753993177] [2024-10-14 07:10:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:37,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:10:37,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:37,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:10:37,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:37,249 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:37,439 INFO L93 Difference]: Finished difference Result 295 states and 433 transitions. [2024-10-14 07:10:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:10:37,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2024-10-14 07:10:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:37,442 INFO L225 Difference]: With dead ends: 295 [2024-10-14 07:10:37,442 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 07:10:37,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:37,443 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 232 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:37,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 994 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 07:10:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-14 07:10:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4683544303797469) internal successors, (232), 158 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2024-10-14 07:10:37,457 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 24 [2024-10-14 07:10:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:37,457 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2024-10-14 07:10:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2024-10-14 07:10:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 07:10:37,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:37,459 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] [2024-10-14 07:10:37,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:10:37,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash -159148378, now seen corresponding path program 1 times [2024-10-14 07:10:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730526537] [2024-10-14 07:10:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730526537] [2024-10-14 07:10:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730526537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:10:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024708566] [2024-10-14 07:10:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:10:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:10:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:37,785 INFO L87 Difference]: Start difference. First operand 159 states and 232 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:37,974 INFO L93 Difference]: Finished difference Result 299 states and 437 transitions. [2024-10-14 07:10:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:10:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-14 07:10:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:37,976 INFO L225 Difference]: With dead ends: 299 [2024-10-14 07:10:37,977 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 07:10:37,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:37,979 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 236 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:37,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1376 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 07:10:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-10-14 07:10:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.462962962962963) internal successors, (237), 162 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2024-10-14 07:10:37,990 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 25 [2024-10-14 07:10:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2024-10-14 07:10:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2024-10-14 07:10:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 07:10:37,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:37,992 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] [2024-10-14 07:10:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:10:37,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:37,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 925912796, now seen corresponding path program 1 times [2024-10-14 07:10:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:37,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534277213] [2024-10-14 07:10:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:10:38,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:10:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:10:38,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:10:38,088 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:10:38,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:10:38,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:10:38,094 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 07:10:38,130 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:10:38,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:10:38 BoogieIcfgContainer [2024-10-14 07:10:38,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:10:38,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:10:38,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:10:38,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:10:38,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:10:35" (3/4) ... [2024-10-14 07:10:38,135 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:10:38,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:10:38,136 INFO L158 Benchmark]: Toolchain (without parser) took 3697.06ms. Allocated memory was 157.3MB in the beginning and 239.1MB in the end (delta: 81.8MB). Free memory was 86.9MB in the beginning and 112.6MB in the end (delta: -25.7MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-10-14 07:10:38,136 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:10:38,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.42ms. Allocated memory was 157.3MB in the beginning and 239.1MB in the end (delta: 81.8MB). Free memory was 86.6MB in the beginning and 206.9MB in the end (delta: -120.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-10-14 07:10:38,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.48ms. Allocated memory is still 239.1MB. Free memory was 206.9MB in the beginning and 192.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:10:38,137 INFO L158 Benchmark]: Boogie Preprocessor took 106.01ms. Allocated memory is still 239.1MB. Free memory was 192.2MB in the beginning and 183.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 07:10:38,138 INFO L158 Benchmark]: RCFGBuilder took 756.50ms. Allocated memory is still 239.1MB. Free memory was 183.8MB in the beginning and 102.0MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-14 07:10:38,138 INFO L158 Benchmark]: TraceAbstraction took 2331.83ms. Allocated memory is still 239.1MB. Free memory was 101.0MB in the beginning and 112.6MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:10:38,138 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 239.1MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:10:38,139 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.19ms. Allocated memory is still 157.3MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.42ms. Allocated memory was 157.3MB in the beginning and 239.1MB in the end (delta: 81.8MB). Free memory was 86.6MB in the beginning and 206.9MB in the end (delta: -120.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.48ms. Allocated memory is still 239.1MB. Free memory was 206.9MB in the beginning and 192.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.01ms. Allocated memory is still 239.1MB. Free memory was 192.2MB in the beginning and 183.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 756.50ms. Allocated memory is still 239.1MB. Free memory was 183.8MB in the beginning and 102.0MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2331.83ms. Allocated memory is still 239.1MB. Free memory was 101.0MB in the beginning and 112.6MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 239.1MB. Free memory is still 112.6MB. 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 131. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L32] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L35] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 3); [L36] const SORT_16 msb_SORT_16 = (SORT_16)1 << (3 - 1); [L38] const SORT_1 var_12 = 0; [L39] const SORT_16 var_17 = 0; [L40] const SORT_16 var_20 = 6; [L41] const SORT_16 var_25 = 7; [L42] const SORT_1 var_30 = 1; [L43] const SORT_5 var_34 = 0; [L44] const SORT_7 var_39 = 0; [L45] const SORT_7 var_42 = 8; [L46] const SORT_7 var_44 = 9; [L47] const SORT_7 var_47 = 15; [L48] const SORT_7 var_55 = 12; [L49] const SORT_7 var_58 = 4; [L50] const SORT_7 var_64 = 10; [L51] const SORT_7 var_66 = 11; [L52] const SORT_7 var_69 = 13; [L53] const SORT_7 var_84 = 1; [L54] const SORT_7 var_89 = 5; [L55] const SORT_16 var_114 = 1; [L56] const SORT_16 var_116 = 5; [L57] const SORT_5 var_125 = 1; [L59] SORT_1 input_2; [L60] SORT_1 input_3; [L61] SORT_1 input_4; [L62] SORT_5 input_6; [L63] SORT_7 input_8; [L64] SORT_1 input_9; [L65] SORT_1 input_10; [L66] SORT_1 input_11; [L67] SORT_5 input_93; [L68] SORT_5 input_95; [L69] SORT_5 input_97; [L70] SORT_5 input_99; [L71] SORT_5 input_101; [L72] SORT_5 input_103; [L73] SORT_5 input_105; [L74] SORT_5 input_107; [L75] SORT_5 input_109; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L77] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L78] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L79] SORT_16 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L80] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L80] SORT_5 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L82] SORT_1 init_14_arg_1 = var_12; [L83] state_13 = init_14_arg_1 [L84] SORT_16 init_19_arg_1 = var_17; [L85] state_18 = init_19_arg_1 [L86] SORT_16 init_24_arg_1 = var_17; [L87] state_23 = init_24_arg_1 [L88] SORT_5 init_36_arg_1 = var_34; [L89] state_35 = init_36_arg_1 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_13=0, state_18=0, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_4 = __VERIFIER_nondet_uchar() [L95] input_6 = __VERIFIER_nondet_ushort() [L96] input_8 = __VERIFIER_nondet_uchar() [L97] EXPR input_8 & mask_SORT_7 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_13=0, state_18=0, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L97] input_8 = input_8 & mask_SORT_7 [L98] input_9 = __VERIFIER_nondet_uchar() [L99] input_10 = __VERIFIER_nondet_uchar() [L100] input_11 = __VERIFIER_nondet_uchar() [L101] input_93 = __VERIFIER_nondet_ushort() [L102] input_95 = __VERIFIER_nondet_ushort() [L103] input_97 = __VERIFIER_nondet_ushort() [L104] input_99 = __VERIFIER_nondet_ushort() [L105] input_101 = __VERIFIER_nondet_ushort() [L106] input_103 = __VERIFIER_nondet_ushort() [L107] input_105 = __VERIFIER_nondet_ushort() [L108] input_107 = __VERIFIER_nondet_ushort() [L109] input_109 = __VERIFIER_nondet_ushort() [L112] SORT_1 var_15_arg_0 = state_13; [L113] SORT_1 var_15_arg_1 = var_12; [L114] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L115] SORT_16 var_21_arg_0 = state_18; [L116] SORT_16 var_21_arg_1 = var_20; [L117] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L118] SORT_1 var_22_arg_0 = var_15; [L119] SORT_1 var_22_arg_1 = var_21; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_22_arg_0=1, var_22_arg_1=1, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L120] EXPR var_22_arg_0 | var_22_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L120] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L121] SORT_16 var_26_arg_0 = state_23; [L122] SORT_16 var_26_arg_1 = var_25; [L123] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L124] SORT_1 var_27_arg_0 = var_22; [L125] SORT_1 var_27_arg_1 = var_26; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L126] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L126] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L127] SORT_1 var_31_arg_0 = var_27; [L128] SORT_1 var_31 = ~var_31_arg_0; [L129] SORT_1 var_32_arg_0 = var_30; [L130] SORT_1 var_32_arg_1 = var_31; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L131] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L131] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L132] EXPR var_32 & mask_SORT_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L132] var_32 = var_32 & mask_SORT_1 [L133] SORT_1 bad_33_arg_0 = var_32; [L134] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 3635 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2809 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 826 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:10:38,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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.vis_arrays_am2910_p2.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 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:10:40,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:10:40,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:10:40,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:10:40,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:10:40,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:10:40,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:10:40,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:10:40,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:10:40,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:10:40,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:10:40,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:10:40,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:10:40,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:10:40,229 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:10:40,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:10:40,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:10:40,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:10:40,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:10:40,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:10:40,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:10:40,230 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:10:40,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:10:40,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:40,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:10:40,232 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:10:40,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:10:40,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:10:40,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:10:40,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:10:40,235 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:10:40,235 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 -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-10-14 07:10:40,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:10:40,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:10:40,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:10:40,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:10:40,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:10:40,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:41,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:10:42,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:10:42,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:42,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293238c23/fda48de898704994b03a4a45386d1b34/FLAG127f45927 [2024-10-14 07:10:42,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293238c23/fda48de898704994b03a4a45386d1b34 [2024-10-14 07:10:42,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:10:42,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:10:42,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:42,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:10:42,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:10:42,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1477f86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42, skipping insertion in model container [2024-10-14 07:10:42,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:10:42,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c[1260,1273] [2024-10-14 07:10:42,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:42,411 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:10:42,439 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c[1260,1273] [2024-10-14 07:10:42,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:42,509 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:10:42,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42 WrapperNode [2024-10-14 07:10:42,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:42,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:42,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:10:42,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:10:42,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,556 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 327 [2024-10-14 07:10:42,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:42,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:10:42,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:10:42,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:10:42,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,598 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:10:42,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:10:42,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:10:42,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:10:42,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:10:42,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (1/1) ... [2024-10-14 07:10:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:42,652 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-10-14 07:10:42,655 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-10-14 07:10:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:10:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:10:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:10:42,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:10:42,793 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:10:42,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:10:43,164 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-14 07:10:43,164 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:10:43,198 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:10:43,199 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:10:43,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:10:43 BoogieIcfgContainer [2024-10-14 07:10:43,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:10:43,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:10:43,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:10:43,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:10:43,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:10:42" (1/3) ... [2024-10-14 07:10:43,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9633f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:10:43, skipping insertion in model container [2024-10-14 07:10:43,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:42" (2/3) ... [2024-10-14 07:10:43,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9633f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:10:43, skipping insertion in model container [2024-10-14 07:10:43,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:10:43" (3/3) ... [2024-10-14 07:10:43,207 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-14 07:10:43,219 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:10:43,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:10:43,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:10:43,273 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;@2f89b6d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:10:43,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:10:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:10:43,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:43,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:10:43,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:43,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:10:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:10:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504101225] [2024-10-14 07:10:43,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:10:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:10:43,304 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-10-14 07:10:43,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:10:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:43,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 07:10:43,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:43,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:10:43,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:10:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504101225] [2024-10-14 07:10:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504101225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:10:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154211538] [2024-10-14 07:10:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:43,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:10:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:10:43,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:10:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:43,551 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:43,583 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 07:10:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:10:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 07:10:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:43,590 INFO L225 Difference]: With dead ends: 14 [2024-10-14 07:10:43,590 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 07:10:43,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:10:43,594 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:43,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 07:10:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 07:10:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:10:43,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:10:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:10:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:10:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:10:43,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:43,615 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:10:43,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:10:43,816 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-10-14 07:10:43,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:10:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:10:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244116410] [2024-10-14 07:10:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:43,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:10:43,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:10:43,821 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-10-14 07:10:43,822 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-10-14 07:10:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:43,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 07:10:43,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:44,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:44,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:10:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244116410] [2024-10-14 07:10:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244116410] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:10:44,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:10:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 07:10:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932667337] [2024-10-14 07:10:44,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:10:44,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:10:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:10:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:10:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:10:44,224 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:44,294 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 07:10:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:10:44,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 07:10:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:44,295 INFO L225 Difference]: With dead ends: 13 [2024-10-14 07:10:44,295 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 07:10:44,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:10:44,297 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:44,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 07:10:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 07:10:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 07:10:44,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 07:10:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:44,300 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 07:10:44,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 07:10:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 07:10:44,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:44,301 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 07:10:44,306 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 (3)] Ended with exit code 0 [2024-10-14 07:10:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:10:44,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 07:10:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:10:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477506379] [2024-10-14 07:10:44,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 07:10:44,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:10:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:10:44,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:10:44,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:10:44,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 07:10:44,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:10:44,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 07:10:44,652 INFO L278 TraceCheckSpWp]: Computing forward predicates...