./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:01:40,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:01:41,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:01:41,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:01:41,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:01:41,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:01:41,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:01:41,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:01:41,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:01:41,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:01:41,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:01:41,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:01:41,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:01:41,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:01:41,078 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:01:41,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:01:41,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:01:41,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:01:41,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:01:41,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:01:41,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:01:41,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:01:41,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:01:41,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:01:41,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:01:41,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:01:41,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:01:41,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:01:41,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:01:41,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:01:41,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:01:41,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:01:41,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:01:41,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:01:41,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:01:41,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:01:41,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:01:41,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:01:41,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:01:41,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-10-11 07:01:41,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:01:41,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:01:41,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:01:41,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:01:41,403 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:01:41,404 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-11 07:01:42,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:01:43,114 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:01:43,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-11 07:01:43,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b87584978/b61fd64627024294921de5f705434000/FLAGb9fd0d9b7 [2024-10-11 07:01:43,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b87584978/b61fd64627024294921de5f705434000 [2024-10-11 07:01:43,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:01:43,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:01:43,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:01:43,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:01:43,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:01:43,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2e1fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43, skipping insertion in model container [2024-10-11 07:01:43,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:01:43,391 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-11 07:01:43,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:01:43,512 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:01:43,521 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-11 07:01:43,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:01:43,593 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:01:43,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43 WrapperNode [2024-10-11 07:01:43,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:01:43,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:01:43,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:01:43,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:01:43,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,701 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 607 [2024-10-11 07:01:43,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:01:43,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:01:43,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:01:43,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:01:43,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:01:43,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:01:43,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:01:43,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:01:43,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:01:43,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (1/1) ... [2024-10-11 07:01:43,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:01:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:01:43,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:01:43,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:01:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:01:43,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:01:44,055 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:01:44,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:01:44,880 INFO L? ?]: Removed 331 outVars from TransFormulas that were not future-live. [2024-10-11 07:01:44,881 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:01:44,916 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:01:44,916 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:01:44,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:01:44 BoogieIcfgContainer [2024-10-11 07:01:44,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:01:44,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:01:44,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:01:44,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:01:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:01:43" (1/3) ... [2024-10-11 07:01:44,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175576e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:01:44, skipping insertion in model container [2024-10-11 07:01:44,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:43" (2/3) ... [2024-10-11 07:01:44,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175576e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:01:44, skipping insertion in model container [2024-10-11 07:01:44,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:01:44" (3/3) ... [2024-10-11 07:01:44,929 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-11 07:01:44,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:01:44,947 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:01:45,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:01:45,044 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;@136ab675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:01:45,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:01:45,050 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-11 07:01:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 07:01:45,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:45,058 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-11 07:01:45,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1081087737, now seen corresponding path program 1 times [2024-10-11 07:01:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:01:45,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836064879] [2024-10-11 07:01:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:01:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:01:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836064879] [2024-10-11 07:01:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836064879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:01:45,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:01:45,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:01:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138981427] [2024-10-11 07:01:45,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:01:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:01:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:01:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:01:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:01:45,685 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-11 07:01:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:45,751 INFO L93 Difference]: Finished difference Result 278 states and 414 transitions. [2024-10-11 07:01:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:01:45,757 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-11 07:01:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:45,765 INFO L225 Difference]: With dead ends: 278 [2024-10-11 07:01:45,765 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 07:01:45,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:01:45,770 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-11 07:01:45,771 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-11 07:01:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 07:01:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-11 07:01:45,804 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-11 07:01:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-11 07:01:45,808 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 22 [2024-10-11 07:01:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:45,809 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-11 07:01:45,809 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-11 07:01:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-11 07:01:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 07:01:45,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:45,810 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-11 07:01:45,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:01:45,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash 847713791, now seen corresponding path program 1 times [2024-10-11 07:01:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:01:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803093695] [2024-10-11 07:01:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:01:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:01:46,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803093695] [2024-10-11 07:01:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803093695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:01:46,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:01:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:01:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102283168] [2024-10-11 07:01:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:01:46,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:01:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:01:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:01:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:01:46,011 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-11 07:01:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:46,061 INFO L93 Difference]: Finished difference Result 281 states and 414 transitions. [2024-10-11 07:01:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:01:46,062 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-11 07:01:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:46,064 INFO L225 Difference]: With dead ends: 281 [2024-10-11 07:01:46,065 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 07:01:46,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:01:46,068 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-11 07:01:46,068 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-11 07:01:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 07:01:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 07:01:46,082 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-11 07:01:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-10-11 07:01:46,086 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 23 [2024-10-11 07:01:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-10-11 07:01:46,087 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-11 07:01:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-10-11 07:01:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 07:01:46,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:46,088 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-11 07:01:46,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:01:46,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash -588642080, now seen corresponding path program 1 times [2024-10-11 07:01:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:01:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195566684] [2024-10-11 07:01:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:01:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:01:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195566684] [2024-10-11 07:01:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195566684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:01:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:01:46,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:01:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138277760] [2024-10-11 07:01:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:01:46,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:01:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:01:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:01:46,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:01:46,637 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-11 07:01:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:46,872 INFO L93 Difference]: Finished difference Result 295 states and 433 transitions. [2024-10-11 07:01:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:01:46,872 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-11 07:01:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:46,875 INFO L225 Difference]: With dead ends: 295 [2024-10-11 07:01:46,877 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 07:01:46,877 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-11 07:01:46,878 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-11 07:01:46,881 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-11 07:01:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 07:01:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-11 07:01:46,893 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-11 07:01:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2024-10-11 07:01:46,894 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 24 [2024-10-11 07:01:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2024-10-11 07:01:46,894 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-11 07:01:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2024-10-11 07:01:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 07:01:46,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:46,899 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-11 07:01:46,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:01:46,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:46,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash -159148378, now seen corresponding path program 1 times [2024-10-11 07:01:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:01:46,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720086354] [2024-10-11 07:01:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:01:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:01:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720086354] [2024-10-11 07:01:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720086354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:01:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:01:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:01:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196540930] [2024-10-11 07:01:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:01:47,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:01:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:01:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:01:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:01:47,339 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-11 07:01:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:47,579 INFO L93 Difference]: Finished difference Result 299 states and 437 transitions. [2024-10-11 07:01:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:01:47,580 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-11 07:01:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:47,581 INFO L225 Difference]: With dead ends: 299 [2024-10-11 07:01:47,582 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 07:01:47,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:01:47,584 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-11 07:01:47,584 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-11 07:01:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 07:01:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-10-11 07:01:47,595 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-11 07:01:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2024-10-11 07:01:47,600 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 25 [2024-10-11 07:01:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2024-10-11 07:01:47,601 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-11 07:01:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2024-10-11 07:01:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 07:01:47,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:47,602 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-11 07:01:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:01:47,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:47,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash 925912796, now seen corresponding path program 1 times [2024-10-11 07:01:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:01:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217731194] [2024-10-11 07:01:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:01:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:01:47,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:01:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:01:47,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:01:47,703 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:01:47,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:01:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:01:47,708 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 07:01:47,764 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:01:47,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:01:47 BoogieIcfgContainer [2024-10-11 07:01:47,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:01:47,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:01:47,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:01:47,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:01:47,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:01:44" (3/4) ... [2024-10-11 07:01:47,775 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:01:47,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:01:47,777 INFO L158 Benchmark]: Toolchain (without parser) took 4621.94ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 128.1MB in the beginning and 202.6MB in the end (delta: -74.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:01:47,777 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:01:47,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.69ms. Allocated memory is still 180.4MB. Free memory was 128.1MB in the beginning and 107.3MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 07:01:47,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.31ms. Allocated memory is still 180.4MB. Free memory was 107.3MB in the beginning and 93.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:01:47,781 INFO L158 Benchmark]: Boogie Preprocessor took 134.16ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 85.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 07:01:47,781 INFO L158 Benchmark]: RCFGBuilder took 1080.68ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 85.1MB in the beginning and 167.3MB in the end (delta: -82.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-10-11 07:01:47,781 INFO L158 Benchmark]: TraceAbstraction took 2850.40ms. Allocated memory is still 249.6MB. Free memory was 166.2MB in the beginning and 202.6MB in the end (delta: -36.4MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2024-10-11 07:01:47,781 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 249.6MB. Free memory is still 202.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:01:47,783 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 180.4MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.69ms. Allocated memory is still 180.4MB. Free memory was 128.1MB in the beginning and 107.3MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.31ms. Allocated memory is still 180.4MB. Free memory was 107.3MB in the beginning and 93.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.16ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 85.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1080.68ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 85.1MB in the beginning and 167.3MB in the end (delta: -82.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2850.40ms. Allocated memory is still 249.6MB. Free memory was 166.2MB in the beginning and 202.6MB in the end (delta: -36.4MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 249.6MB. Free memory is still 202.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.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, 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.3s 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.4s 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-11 07:01:47,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:01:50,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:01:50,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:01:50,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:01:50,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:01:50,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:01:50,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:01:50,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:01:50,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:01:50,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:01:50,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:01:50,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:01:50,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:01:50,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:01:50,162 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:01:50,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:01:50,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:01:50,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:01:50,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:01:50,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:01:50,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:01:50,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:01:50,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:01:50,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:01:50,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:01:50,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:01:50,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:01:50,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:01:50,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:01:50,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:01:50,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:01:50,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:01:50,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:01:50,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:01:50,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:01:50,172 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:01:50,172 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:01:50,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:01:50,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:01:50,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:01:50,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:01:50,173 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:01:50,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-10-11 07:01:50,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:01:50,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:01:50,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:01:50,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:01:50,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:01:50,526 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-11 07:01:52,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:01:52,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:01:52,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-11 07:01:52,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/81b249666/924273bb26144da9995ce781c3ac2d14/FLAG33f75aecf [2024-10-11 07:01:52,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/81b249666/924273bb26144da9995ce781c3ac2d14 [2024-10-11 07:01:52,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:01:52,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:01:52,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:01:52,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:01:52,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:01:52,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:52" (1/1) ... [2024-10-11 07:01:52,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71278785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:52, skipping insertion in model container [2024-10-11 07:01:52,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:01:52" (1/1) ... [2024-10-11 07:01:52,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:01:52,897 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-11 07:01:52,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:01:53,010 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:01:53,021 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-11 07:01:53,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:01:53,105 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:01:53,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53 WrapperNode [2024-10-11 07:01:53,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:01:53,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:01:53,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:01:53,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:01:53,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,163 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 327 [2024-10-11 07:01:53,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:01:53,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:01:53,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:01:53,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:01:53,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:01:53,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:01:53,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:01:53,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:01:53,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:01:53,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (1/1) ... [2024-10-11 07:01:53,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:01:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:01:53,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:01:53,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:01:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:01:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:01:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:01:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:01:53,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:01:53,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:01:53,802 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-11 07:01:53,803 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:01:53,836 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:01:53,837 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:01:53,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:01:53 BoogieIcfgContainer [2024-10-11 07:01:53,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:01:53,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:01:53,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:01:53,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:01:53,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:01:52" (1/3) ... [2024-10-11 07:01:53,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be6bac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:01:53, skipping insertion in model container [2024-10-11 07:01:53,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:01:53" (2/3) ... [2024-10-11 07:01:53,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be6bac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:01:53, skipping insertion in model container [2024-10-11 07:01:53,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:01:53" (3/3) ... [2024-10-11 07:01:53,846 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-10-11 07:01:53,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:01:53,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:01:53,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:01:53,926 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;@4f6592e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:01:53,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:01:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:01:53,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:53,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:01:53,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:53,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:01:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:01:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516502141] [2024-10-11 07:01:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:53,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:01:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:01:53,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:01:53,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:01:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:54,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:01:54,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:01:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:54,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:01:54,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:01:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516502141] [2024-10-11 07:01:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516502141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:01:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:01:54,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:01:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852801492] [2024-10-11 07:01:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:01:54,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:01:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:01:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:01:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:01:54,328 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:54,372 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-11 07:01:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:01:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 07:01:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:54,382 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:01:54,382 INFO L226 Difference]: Without dead ends: 8 [2024-10-11 07:01:54,385 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-11 07:01:54,390 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-11 07:01:54,391 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-11 07:01:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-11 07:01:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-11 07:01:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:01:54,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:01:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:54,419 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:01:54,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:01:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:01:54,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:54,420 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:01:54,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:01:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:01:54,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:54,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:01:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:01:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166047455] [2024-10-11 07:01:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:01:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:01:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:01:54,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:01:54,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:01:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:01:54,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 07:01:54,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:01:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:54,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:01:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:01:55,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:01:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166047455] [2024-10-11 07:01:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166047455] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:01:55,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:01:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:01:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122189231] [2024-10-11 07:01:55,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:01:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:01:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:01:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:01:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:01:55,201 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:01:55,306 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 07:01:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:01:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 07:01:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:01:55,307 INFO L225 Difference]: With dead ends: 13 [2024-10-11 07:01:55,307 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 07:01:55,308 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-11 07:01:55,309 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:01:55,310 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.1s Time] [2024-10-11 07:01:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 07:01:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 07:01:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:01:55,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:01:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:01:55,314 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:01:55,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:01:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:01:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:01:55,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:01:55,315 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:01:55,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:01:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:01:55,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:01:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:01:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:01:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:01:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994835440] [2024-10-11 07:01:55,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:01:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:01:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:01:55,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:01:55,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:01:55,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:01:55,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:01:55,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:01:55,725 INFO L278 TraceCheckSpWp]: Computing forward predicates...