./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:18,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:18,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:07:18,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:18,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:18,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:18,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:18,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:18,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:18,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:18,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:18,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:18,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:18,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:18,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:18,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:18,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:18,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:18,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:07:18,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:18,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:18,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:18,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:18,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:18,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:18,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:18,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:18,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:18,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:18,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:18,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:18,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:18,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:18,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:18,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:18,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:18,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:18,384 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 [2024-11-19 01:07:18,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:18,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:18,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:18,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:18,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:18,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:19,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:20,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:20,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:20,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ade1076/f6d721253d9b4688afd129c6b1c6e05c/FLAGef8fd6c53 [2024-11-19 01:07:20,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ade1076/f6d721253d9b4688afd129c6b1c6e05c [2024-11-19 01:07:20,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:20,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:20,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:20,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:20,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:20,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522e74d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20, skipping insertion in model container [2024-11-19 01:07:20,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:20,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2024-11-19 01:07:20,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:20,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:20,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2024-11-19 01:07:20,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:20,804 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:20,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20 WrapperNode [2024-11-19 01:07:20,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:20,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:20,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:20,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:20,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,879 INFO L138 Inliner]: procedures = 30, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 563 [2024-11-19 01:07:20,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:20,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:20,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:20,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:20,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,919 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:07:20,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:20,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:20,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:20,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:20,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (1/1) ... [2024-11-19 01:07:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:20,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:07:21,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:07:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:07:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:21,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:07:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:21,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:21,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:21,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:22,052 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:22,052 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:22,087 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:22,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:22,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:22 BoogieIcfgContainer [2024-11-19 01:07:22,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:22,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:22,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:22,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:22,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:20" (1/3) ... [2024-11-19 01:07:22,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f5bb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:22, skipping insertion in model container [2024-11-19 01:07:22,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:20" (2/3) ... [2024-11-19 01:07:22,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f5bb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:22, skipping insertion in model container [2024-11-19 01:07:22,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:22" (3/3) ... [2024-11-19 01:07:22,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:22,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:22,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:22,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:22,217 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;@7777f887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:22,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 01:07:22,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:22,250 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:22,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:22,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -185737168, now seen corresponding path program 1 times [2024-11-19 01:07:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:22,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588895151] [2024-11-19 01:07:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-19 01:07:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588895151] [2024-11-19 01:07:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588895151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926114287] [2024-11-19 01:07:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:22,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:22,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:22,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:07:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:22,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:22,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-11-19 01:07:22,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926114287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:07:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631620810] [2024-11-19 01:07:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:23,030 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:23,070 INFO L93 Difference]: Finished difference Result 273 states and 431 transitions. [2024-11-19 01:07:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-19 01:07:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:23,088 INFO L225 Difference]: With dead ends: 273 [2024-11-19 01:07:23,088 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 01:07:23,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:23,103 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:23,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 01:07:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-19 01:07:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-19 01:07:23,160 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2024-11-19 01:07:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:23,163 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-19 01:07:23,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-19 01:07:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 01:07:23,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:23,191 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:23,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:23,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:07:23,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1976995918, now seen corresponding path program 1 times [2024-11-19 01:07:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606321422] [2024-11-19 01:07:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606321422] [2024-11-19 01:07:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606321422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:07:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818232580] [2024-11-19 01:07:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:07:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:07:26,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:07:26,148 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:26,462 INFO L93 Difference]: Finished difference Result 402 states and 591 transitions. [2024-11-19 01:07:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:07:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2024-11-19 01:07:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:26,466 INFO L225 Difference]: With dead ends: 402 [2024-11-19 01:07:26,466 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 01:07:26,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:26,467 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:26,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 347 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:07:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 01:07:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 256. [2024-11-19 01:07:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 203 states have (on average 1.3596059113300492) internal successors, (276), 203 states have internal predecessors, (276), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 01:07:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2024-11-19 01:07:26,488 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 189 [2024-11-19 01:07:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2024-11-19 01:07:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2024-11-19 01:07:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 01:07:26,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:26,491 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:26,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:07:26,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:26,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2115807315, now seen corresponding path program 1 times [2024-11-19 01:07:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050024620] [2024-11-19 01:07:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050024620] [2024-11-19 01:07:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050024620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:26,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:26,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:07:26,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847475364] [2024-11-19 01:07:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:26,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:07:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:07:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:26,745 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:26,760 INFO L93 Difference]: Finished difference Result 509 states and 749 transitions. [2024-11-19 01:07:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:07:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2024-11-19 01:07:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:26,762 INFO L225 Difference]: With dead ends: 509 [2024-11-19 01:07:26,762 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 01:07:26,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:26,764 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:26,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 01:07:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-19 01:07:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 01:07:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2024-11-19 01:07:26,778 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 191 [2024-11-19 01:07:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:26,778 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2024-11-19 01:07:26,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2024-11-19 01:07:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 01:07:26,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:26,780 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:07:26,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:26,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1756458155, now seen corresponding path program 1 times [2024-11-19 01:07:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304350264] [2024-11-19 01:07:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304350264] [2024-11-19 01:07:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304350264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:27,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134946469] [2024-11-19 01:07:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:27,562 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:28,290 INFO L93 Difference]: Finished difference Result 509 states and 745 transitions. [2024-11-19 01:07:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:07:28,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2024-11-19 01:07:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:28,295 INFO L225 Difference]: With dead ends: 509 [2024-11-19 01:07:28,295 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 01:07:28,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:28,297 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 612 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:07:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 01:07:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-19 01:07:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 203 states have internal predecessors, (272), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 01:07:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2024-11-19 01:07:28,310 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 191 [2024-11-19 01:07:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:28,311 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2024-11-19 01:07:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2024-11-19 01:07:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 01:07:28,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:28,313 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:28,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:07:28,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:28,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1498292717, now seen corresponding path program 1 times [2024-11-19 01:07:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288165974] [2024-11-19 01:07:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288165974] [2024-11-19 01:07:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288165974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:07:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584483707] [2024-11-19 01:07:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:07:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:07:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:07:29,633 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:30,845 INFO L93 Difference]: Finished difference Result 762 states and 1110 transitions. [2024-11-19 01:07:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:07:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2024-11-19 01:07:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:30,849 INFO L225 Difference]: With dead ends: 762 [2024-11-19 01:07:30,849 INFO L226 Difference]: Without dead ends: 509 [2024-11-19 01:07:30,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:07:30,851 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:30,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 606 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:07:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-19 01:07:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2024-11-19 01:07:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 402 states have (on average 1.3383084577114428) internal successors, (538), 402 states have internal predecessors, (538), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 01:07:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 738 transitions. [2024-11-19 01:07:30,909 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 738 transitions. Word has length 191 [2024-11-19 01:07:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 738 transitions. [2024-11-19 01:07:30,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 738 transitions. [2024-11-19 01:07:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 01:07:30,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:30,916 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:07:30,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2095610001, now seen corresponding path program 1 times [2024-11-19 01:07:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843780660] [2024-11-19 01:07:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843780660] [2024-11-19 01:07:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843780660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:31,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:07:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713605033] [2024-11-19 01:07:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:07:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:07:31,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:31,168 INFO L87 Difference]: Start difference. First operand 507 states and 738 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,185 INFO L93 Difference]: Finished difference Result 859 states and 1253 transitions. [2024-11-19 01:07:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:07:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2024-11-19 01:07:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,188 INFO L225 Difference]: With dead ends: 859 [2024-11-19 01:07:31,188 INFO L226 Difference]: Without dead ends: 355 [2024-11-19 01:07:31,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:31,190 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:31,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-19 01:07:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 267. [2024-11-19 01:07:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 214 states have (on average 1.341121495327103) internal successors, (287), 214 states have internal predecessors, (287), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 01:07:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 387 transitions. [2024-11-19 01:07:31,223 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 387 transitions. Word has length 191 [2024-11-19 01:07:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,223 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 387 transitions. [2024-11-19 01:07:31,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 387 transitions. [2024-11-19 01:07:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:07:31,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,225 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:07:31,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -448238812, now seen corresponding path program 1 times [2024-11-19 01:07:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898918372] [2024-11-19 01:07:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898918372] [2024-11-19 01:07:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898918372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011354158] [2024-11-19 01:07:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:31,496 INFO L87 Difference]: Start difference. First operand 267 states and 387 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,782 INFO L93 Difference]: Finished difference Result 799 states and 1159 transitions. [2024-11-19 01:07:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:07:31,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 01:07:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,785 INFO L225 Difference]: With dead ends: 799 [2024-11-19 01:07:31,785 INFO L226 Difference]: Without dead ends: 535 [2024-11-19 01:07:31,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:07:31,787 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 174 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:31,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 604 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:07:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-19 01:07:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 273. [2024-11-19 01:07:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 220 states have (on average 1.3318181818181818) internal successors, (293), 220 states have internal predecessors, (293), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 01:07:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 393 transitions. [2024-11-19 01:07:31,810 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 393 transitions. Word has length 192 [2024-11-19 01:07:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,812 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 393 transitions. [2024-11-19 01:07:31,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 393 transitions. [2024-11-19 01:07:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:07:31,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,816 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:31,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:07:31,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2036586714, now seen corresponding path program 1 times [2024-11-19 01:07:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737776518] [2024-11-19 01:07:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:07:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133459719] [2024-11-19 01:07:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:31,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:31,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:07:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:33,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:07:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:36,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:07:36,749 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:07:36,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:07:36,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:07:36,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 01:07:36,956 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:37,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:07:37,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:07:37 BoogieIcfgContainer [2024-11-19 01:07:37,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:07:37,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:07:37,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:07:37,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:07:37,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:22" (3/4) ... [2024-11-19 01:07:37,038 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:07:37,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:07:37,044 INFO L158 Benchmark]: Toolchain (without parser) took 16601.30ms. Allocated memory was 201.3MB in the beginning and 564.1MB in the end (delta: 362.8MB). Free memory was 130.5MB in the beginning and 505.7MB in the end (delta: -375.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:37,044 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:37,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.01ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 110.4MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:07:37,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.19ms. Allocated memory is still 201.3MB. Free memory was 109.9MB in the beginning and 105.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:07:37,044 INFO L158 Benchmark]: Boogie Preprocessor took 74.60ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 101.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:07:37,045 INFO L158 Benchmark]: RCFGBuilder took 1129.67ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 161.2MB in the end (delta: -60.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-19 01:07:37,045 INFO L158 Benchmark]: TraceAbstraction took 14937.38ms. Allocated memory was 201.3MB in the beginning and 564.1MB in the end (delta: 362.8MB). Free memory was 160.1MB in the beginning and 505.7MB in the end (delta: -345.5MB). Peak memory consumption was 341.3MB. Max. memory is 16.1GB. [2024-11-19 01:07:37,046 INFO L158 Benchmark]: Witness Printer took 11.78ms. Allocated memory is still 564.1MB. Free memory is still 505.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:37,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.01ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 110.4MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.19ms. Allocated memory is still 201.3MB. Free memory was 109.9MB in the beginning and 105.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.60ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 101.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1129.67ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 161.2MB in the end (delta: -60.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14937.38ms. Allocated memory was 201.3MB in the beginning and 564.1MB in the end (delta: 362.8MB). Free memory was 160.1MB in the beginning and 505.7MB in the end (delta: -345.5MB). Peak memory consumption was 341.3MB. Max. memory is 16.1GB. * Witness Printer took 11.78ms. Allocated memory is still 564.1MB. Free memory is still 505.7MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 999999.2, 5, -2, 0.0, 5.9, 255.6, 25.5, 0, 0.0, 1, 0, 0, 0, 1, 1, 64, -10, 5 }; [L63] unsigned char last_1_WrapperStruct00_var_1_18 = 64; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=64] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_18 [L128] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_long() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] EXPR (WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L103] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L107] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L110] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L113] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L119] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L123] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L139] RET updateVariables() [L140] CALL step() [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_4 [L67] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L67] COND TRUE ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18 [L68] EXPR WrapperStruct00.var_1_20 [L68] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_20 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L70] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L70] COND TRUE (WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18))) [L71] EXPR WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_7 [L71] EXPR WrapperStruct00.var_1_8 [L71] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8) [L75] EXPR WrapperStruct00.var_1_18 [L75] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L75] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L76] COND TRUE WrapperStruct00.var_1_10 [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L77] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14) [L82] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L82] COND FALSE !(WrapperStruct00.var_1_12) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR ((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7))) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_6 [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR ((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR ((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1)) && ((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18) ? (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_20)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131-L132] return (((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1)) && ((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18) ? (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_20)) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 3144 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1957 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1187 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 365 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1907 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1515 ConstructedInterpolants, 0 QuantifiedInterpolants, 2298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 9552/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:07:37,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:39,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:39,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:07:39,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:39,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:39,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:39,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:39,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:39,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:39,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:39,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:39,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:39,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:39,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:39,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:39,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:39,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:39,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:39,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:39,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:39,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:39,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:39,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:39,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:07:39,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:07:39,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:39,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:07:39,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:39,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:39,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:39,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:39,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:39,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:39,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:39,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:39,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:39,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:39,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:39,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:07:39,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:07:39,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:39,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:39,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:39,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:39,471 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 [2024-11-19 01:07:39,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:39,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:39,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:39,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:39,844 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:39,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:41,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:41,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:41,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:41,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dea49480/f40533411c834be1bdcd6d9048def8fb/FLAGbfd4b9fd4 [2024-11-19 01:07:41,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dea49480/f40533411c834be1bdcd6d9048def8fb [2024-11-19 01:07:41,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:41,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:41,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:41,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:41,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:41,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:41" (1/1) ... [2024-11-19 01:07:41,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20af9a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:41, skipping insertion in model container [2024-11-19 01:07:41,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:41" (1/1) ... [2024-11-19 01:07:41,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:41,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2024-11-19 01:07:41,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:41,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:42,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2024-11-19 01:07:42,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:42,078 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:42,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42 WrapperNode [2024-11-19 01:07:42,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:42,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:42,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:42,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:42,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,152 INFO L138 Inliner]: procedures = 40, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 560 [2024-11-19 01:07:42,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:42,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:42,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:42,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:42,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,217 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 39 writes are split as follows [0, 39]. [2024-11-19 01:07:42,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:42,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:42,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:42,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:42,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (1/1) ... [2024-11-19 01:07:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:42,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:42,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:07:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:07:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:07:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:07:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:07:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:07:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:07:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:42,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:07:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:07:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:07:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:07:42,498 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:42,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:51,656 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:51,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:51,672 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:51,673 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:51,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:51 BoogieIcfgContainer [2024-11-19 01:07:51,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:51,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:51,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:51,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:51,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:41" (1/3) ... [2024-11-19 01:07:51,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500e7617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:51, skipping insertion in model container [2024-11-19 01:07:51,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:42" (2/3) ... [2024-11-19 01:07:51,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500e7617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:51, skipping insertion in model container [2024-11-19 01:07:51,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:51" (3/3) ... [2024-11-19 01:07:51,680 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-45.i [2024-11-19 01:07:51,694 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:51,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:51,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:51,750 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;@46fc88d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:51,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:51,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 01:07:51,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:51,768 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:51,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:51,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -299657412, now seen corresponding path program 1 times [2024-11-19 01:07:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335548437] [2024-11-19 01:07:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:51,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:51,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:07:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:52,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:52,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2024-11-19 01:07:52,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:52,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335548437] [2024-11-19 01:07:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335548437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:52,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:52,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:07:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776535302] [2024-11-19 01:07:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:52,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:52,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:52,434 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:52,473 INFO L93 Difference]: Finished difference Result 273 states and 431 transitions. [2024-11-19 01:07:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-19 01:07:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:52,486 INFO L225 Difference]: With dead ends: 273 [2024-11-19 01:07:52,486 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 01:07:52,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:52,494 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:52,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 01:07:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-19 01:07:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-19 01:07:52,548 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2024-11-19 01:07:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:52,548 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-19 01:07:52,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-19 01:07:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 01:07:52,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:52,554 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:52,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:07:52,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:52,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1863075674, now seen corresponding path program 1 times [2024-11-19 01:07:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810851845] [2024-11-19 01:07:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:52,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:52,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:52,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:07:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:53,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:07:53,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 01:07:53,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:53,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810851845] [2024-11-19 01:07:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810851845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:07:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614068693] [2024-11-19 01:07:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:53,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:07:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:53,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:07:53,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:07:53,437 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:53,509 INFO L93 Difference]: Finished difference Result 271 states and 398 transitions. [2024-11-19 01:07:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:07:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-19 01:07:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:53,511 INFO L225 Difference]: With dead ends: 271 [2024-11-19 01:07:53,511 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 01:07:53,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:07:53,513 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:53,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:07:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 01:07:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-19 01:07:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-11-19 01:07:53,528 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 189 [2024-11-19 01:07:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:53,530 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-11-19 01:07:53,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:07:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-11-19 01:07:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 01:07:53,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:53,532 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:53,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:53,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1891462116, now seen corresponding path program 1 times [2024-11-19 01:07:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759312470] [2024-11-19 01:07:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:53,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:53,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:07:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:54,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:07:54,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 01:07:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:54,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:54,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759312470] [2024-11-19 01:07:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759312470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:07:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238182042] [2024-11-19 01:07:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:54,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:07:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:07:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:54,381 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:54,410 INFO L93 Difference]: Finished difference Result 273 states and 399 transitions. [2024-11-19 01:07:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:07:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2024-11-19 01:07:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:54,413 INFO L225 Difference]: With dead ends: 273 [2024-11-19 01:07:54,413 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 01:07:54,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:54,414 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:54,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 01:07:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-19 01:07:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:07:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 200 transitions. [2024-11-19 01:07:54,422 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 200 transitions. Word has length 189 [2024-11-19 01:07:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:54,423 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 200 transitions. [2024-11-19 01:07:54,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2024-11-19 01:07:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:07:54,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:54,425 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:54,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 01:07:54,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:54,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -312205600, now seen corresponding path program 1 times [2024-11-19 01:07:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700987072] [2024-11-19 01:07:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:54,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:54,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:54,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:54,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:07:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:55,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:07:55,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:55,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 01:07:55,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 01:07:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-19 01:07:55,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:55,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700987072] [2024-11-19 01:07:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700987072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95346160] [2024-11-19 01:07:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:55,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:55,196 INFO L87 Difference]: Start difference. First operand 138 states and 200 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:07:56,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:07:58,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:05,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:08,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:09,918 INFO L93 Difference]: Finished difference Result 410 states and 596 transitions. [2024-11-19 01:08:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-19 01:08:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:09,923 INFO L225 Difference]: With dead ends: 410 [2024-11-19 01:08:09,929 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 01:08:09,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:09,935 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 176 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:09,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 607 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-19 01:08:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 01:08:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 141. [2024-11-19 01:08:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:08:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-19 01:08:09,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 192 [2024-11-19 01:08:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:09,975 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-19 01:08:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-19 01:08:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-19 01:08:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-19 01:08:09,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:09,983 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:10,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:10,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:10,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1900553502, now seen corresponding path program 1 times [2024-11-19 01:08:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912381810] [2024-11-19 01:08:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:10,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:10,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:08:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:10,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:08:10,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:11,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:11,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-19 01:08:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-19 01:08:11,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:11,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912381810] [2024-11-19 01:08:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912381810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083375964] [2024-11-19 01:08:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:11,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:11,229 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:12,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:14,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:17,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:20,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:20,297 INFO L93 Difference]: Finished difference Result 280 states and 404 transitions. [2024-11-19 01:08:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-19 01:08:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:20,299 INFO L225 Difference]: With dead ends: 280 [2024-11-19 01:08:20,299 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 01:08:20,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:08:20,300 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 178 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:20,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 576 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-19 01:08:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 01:08:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-19 01:08:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 114 states have internal predecessors, (152), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:08:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-19 01:08:20,307 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 192 [2024-11-19 01:08:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:20,308 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-19 01:08:20,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-19 01:08:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 01:08:20,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:20,310 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:20,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:20,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:20,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2058474726, now seen corresponding path program 1 times [2024-11-19 01:08:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502160543] [2024-11-19 01:08:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:20,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:20,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:20,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 01:08:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:20,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:08:20,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-11-19 01:08:21,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:21,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502160543] [2024-11-19 01:08:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502160543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:21,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599341960] [2024-11-19 01:08:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:21,073 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 01:08:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:21,534 INFO L93 Difference]: Finished difference Result 283 states and 406 transitions. [2024-11-19 01:08:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2024-11-19 01:08:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:21,536 INFO L225 Difference]: With dead ends: 283 [2024-11-19 01:08:21,536 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 01:08:21,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:21,539 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:21,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 783 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 01:08:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-19 01:08:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:08:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 201 transitions. [2024-11-19 01:08:21,556 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 201 transitions. Word has length 194 [2024-11-19 01:08:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 201 transitions. [2024-11-19 01:08:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-19 01:08:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 201 transitions. [2024-11-19 01:08:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 01:08:21,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:21,558 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:21,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:21,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1488202920, now seen corresponding path program 1 times [2024-11-19 01:08:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171013802] [2024-11-19 01:08:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:21,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:21,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:21,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:21,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:08:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:22,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:08:22,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:22,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:22,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:08:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-19 01:08:22,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:22,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171013802] [2024-11-19 01:08:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171013802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428944220] [2024-11-19 01:08:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:22,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:22,859 INFO L87 Difference]: Start difference. First operand 141 states and 201 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:24,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:28,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:29,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:33,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:33,858 INFO L93 Difference]: Finished difference Result 280 states and 400 transitions. [2024-11-19 01:08:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 194 [2024-11-19 01:08:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:33,860 INFO L225 Difference]: With dead ends: 280 [2024-11-19 01:08:33,861 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 01:08:33,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:08:33,861 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 167 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:33,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 568 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2024-11-19 01:08:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 01:08:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-19 01:08:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:08:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 200 transitions. [2024-11-19 01:08:33,873 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 200 transitions. Word has length 194 [2024-11-19 01:08:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:33,874 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 200 transitions. [2024-11-19 01:08:33,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 200 transitions. [2024-11-19 01:08:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-19 01:08:33,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:33,876 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:33,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:34,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1376880862, now seen corresponding path program 1 times [2024-11-19 01:08:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:34,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999188413] [2024-11-19 01:08:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:34,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:34,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:34,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 01:08:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:34,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:08:34,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:34,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:34,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:08:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-19 01:08:34,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:34,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999188413] [2024-11-19 01:08:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999188413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966866338] [2024-11-19 01:08:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:34,981 INFO L87 Difference]: Start difference. First operand 141 states and 200 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:39,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:42,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:45,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:46,061 INFO L93 Difference]: Finished difference Result 279 states and 397 transitions. [2024-11-19 01:08:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 196 [2024-11-19 01:08:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:46,065 INFO L225 Difference]: With dead ends: 279 [2024-11-19 01:08:46,065 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 01:08:46,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:08:46,066 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 159 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:46,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 562 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-19 01:08:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 01:08:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-19 01:08:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:08:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 197 transitions. [2024-11-19 01:08:46,071 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 197 transitions. Word has length 196 [2024-11-19 01:08:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 197 transitions. [2024-11-19 01:08:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-19 01:08:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 197 transitions. [2024-11-19 01:08:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-19 01:08:46,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:46,073 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:46,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 01:08:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:46,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -728052118, now seen corresponding path program 1 times [2024-11-19 01:08:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652890317] [2024-11-19 01:08:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:46,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:46,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 01:08:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:46,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:08:46,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:47,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:47,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-19 01:08:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-19 01:08:47,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:47,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:47,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-19 01:08:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-19 01:08:47,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652890317] [2024-11-19 01:08:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652890317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:08:47,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:08:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 01:08:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236592586] [2024-11-19 01:08:47,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:08:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:08:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:08:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:08:47,641 INFO L87 Difference]: Start difference. First operand 139 states and 197 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-11-19 01:08:49,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:52,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:55,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []