./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_operatoramount_amount10_file-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:33:48,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:33:48,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:33:48,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:33:48,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:33:48,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:33:48,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:33:48,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:33:48,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:33:48,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:33:48,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:33:48,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:33:48,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:33:48,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:33:48,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:33:48,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:33:48,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:33:48,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:33:48,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:33:48,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:33:48,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:33:48,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:33:48,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:33:48,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:33:48,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:33:48,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:33:48,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:33:48,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:33:48,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:48,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:33:48,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:33:48,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:33:48,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:33:48,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:33:48,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:33:48,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:33:48,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:33:48,782 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2024-11-09 00:33:48,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:33:48,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:33:48,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:33:48,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:33:48,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:33:48,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:50,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:33:50,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:33:50,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:50,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad00f0bf/22e67f28e2e745c892c4bd3fbc526fc2/FLAG3bff08e30 [2024-11-09 00:33:50,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad00f0bf/22e67f28e2e745c892c4bd3fbc526fc2 [2024-11-09 00:33:50,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:33:50,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:33:50,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:50,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:33:50,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:33:50,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:50,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1b3f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50, skipping insertion in model container [2024-11-09 00:33:50,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:50,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:33:50,916 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_operatoramount_amount10_file-54.i[915,928] [2024-11-09 00:33:50,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:50,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:33:50,967 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_operatoramount_amount10_file-54.i[915,928] [2024-11-09 00:33:50,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:50,996 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:33:50,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50 WrapperNode [2024-11-09 00:33:50,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:51,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:51,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:33:51,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:33:51,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,035 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-09 00:33:51,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:51,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:33:51,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:33:51,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:33:51,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,059 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:33:51,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:33:51,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:33:51,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:33:51,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:33:51,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (1/1) ... [2024-11-09 00:33:51,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:33:51,092 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-09 00:33:51,093 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-09 00:33:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:33:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:33:51,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:33:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:33:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:33:51,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:33:51,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:33:51,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:33:51,283 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:33:51,283 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:33:51,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:33:51,292 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:33:51,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:51 BoogieIcfgContainer [2024-11-09 00:33:51,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:33:51,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:33:51,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:33:51,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:33:51,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:33:50" (1/3) ... [2024-11-09 00:33:51,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f18c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:51, skipping insertion in model container [2024-11-09 00:33:51,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:50" (2/3) ... [2024-11-09 00:33:51,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f18c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:51, skipping insertion in model container [2024-11-09 00:33:51,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:51" (3/3) ... [2024-11-09 00:33:51,299 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:51,311 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:33:51,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:33:51,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:33:51,356 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;@7c902d51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:33:51,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:33:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:51,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:51,370 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:51,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 696913717, now seen corresponding path program 1 times [2024-11-09 00:33:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032832655] [2024-11-09 00:33:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:33:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:33:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:33:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:33:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:33:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:33:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:33:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:33:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:33:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032832655] [2024-11-09 00:33:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032832655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:33:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210342639] [2024-11-09 00:33:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:51,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:33:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:33:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:33:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:51,628 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:33:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:51,646 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2024-11-09 00:33:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:33:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-11-09 00:33:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:51,653 INFO L225 Difference]: With dead ends: 61 [2024-11-09 00:33:51,653 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 00:33:51,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-09 00:33:51,659 INFO L432 NwaCegarLoop]: 39 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, 39 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-09 00:33:51,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 00:33:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 00:33:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-09 00:33:51,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2024-11-09 00:33:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-09 00:33:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:33:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-09 00:33:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:51,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:51,697 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:33:51,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -469856391, now seen corresponding path program 1 times [2024-11-09 00:33:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416352067] [2024-11-09 00:33:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:33:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:33:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:33:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:33:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:33:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:33:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:33:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:33:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:33:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416352067] [2024-11-09 00:33:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416352067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:33:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300982299] [2024-11-09 00:33:51,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:51,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:33:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:33:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:33:51,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:33:51,846 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:51,865 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-11-09 00:33:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:33:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-11-09 00:33:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:51,868 INFO L225 Difference]: With dead ends: 57 [2024-11-09 00:33:51,868 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 00:33:51,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-09 00:33:51,869 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:51,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 00:33:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 00:33:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 00:33:51,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2024-11-09 00:33:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:51,887 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 00:33:51,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 00:33:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:51,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:51,889 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:51,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:33:51,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:51,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -412598089, now seen corresponding path program 1 times [2024-11-09 00:33:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:33:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146753333] [2024-11-09 00:33:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:33:51,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:33:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:33:52,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:33:52,017 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:33:52,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:33:52,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:33:52,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:33:52,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:33:52,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:52 BoogieIcfgContainer [2024-11-09 00:33:52,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:33:52,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:33:52,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:33:52,049 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:33:52,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:51" (3/4) ... [2024-11-09 00:33:52,051 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:33:52,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:33:52,053 INFO L158 Benchmark]: Toolchain (without parser) took 1315.87ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 63.4MB in the beginning and 156.8MB in the end (delta: -93.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:52,053 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:52,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.46ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 63.1MB in the beginning and 163.7MB in the end (delta: -100.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-09 00:33:52,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.39ms. Allocated memory is still 197.1MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:52,056 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 197.1MB. Free memory was 161.6MB in the beginning and 160.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:52,057 INFO L158 Benchmark]: RCFGBuilder took 224.71ms. Allocated memory is still 197.1MB. Free memory was 160.6MB in the beginning and 146.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:33:52,057 INFO L158 Benchmark]: TraceAbstraction took 754.41ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 157.9MB in the end (delta: -10.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:52,057 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 197.1MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:52,059 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 134.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.46ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 63.1MB in the beginning and 163.7MB in the end (delta: -100.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.39ms. Allocated memory is still 197.1MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 197.1MB. Free memory was 161.6MB in the beginning and 160.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.71ms. Allocated memory is still 197.1MB. Free memory was 160.6MB in the beginning and 146.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 754.41ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 157.9MB in the end (delta: -10.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 197.1MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999.25; [L23] float var_1_5 = 63.875; [L24] float var_1_6 = 25.05; [L25] signed long int var_1_7 = -4; [L26] float var_1_8 = 25.2; [L27] signed long int var_1_9 = 2; [L28] signed long int var_1_10 = 256; [L29] signed long int last_1_var_1_7 = -4; VAL [isInitial=0, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_5=511/8, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L59] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_5=511/8, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_5 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L45] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L46] var_1_6 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L47] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L48] var_1_8 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L49] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L51] var_1_9 = __VERIFIER_nondet_long() [L52] CALL assume_abort_if_not(var_1_9 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L52] RET assume_abort_if_not(var_1_9 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L53] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L53] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L54] var_1_10 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_10 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L55] RET assume_abort_if_not(var_1_10 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L56] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L56] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L70] RET updateVariables() [L71] CALL step() [L33] signed long int stepLocal_0 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-4, stepLocal_0=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L34] COND FALSE !(last_1_var_1_7 < stepLocal_0) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=-1073741823] [L37] COND TRUE (((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1 [L38] var_1_7 = (var_1_9 + var_1_10) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=-1073741823] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return ((last_1_var_1_7 < last_1_var_1_7) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && (((((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_10))) : (var_1_7 == ((signed long int) 50))) ; VAL [\result=0, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=-1073741823] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=-1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=-1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 224/224 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-09 00:33:52,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount10_file-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:33:53,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:33:53,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:33:53,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:33:53,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:33:53,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:33:53,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:33:53,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:33:53,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:33:53,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:33:53,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:33:53,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:33:53,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:33:53,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:33:53,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:33:53,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:33:53,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:33:53,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:33:53,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:33:53,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:33:53,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:33:53,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:33:53,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:33:53,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:33:53,927 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:33:53,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:33:53,928 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:33:53,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:33:53,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:33:53,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:33:53,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:33:53,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:33:53,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:33:53,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:33:53,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:53,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:33:53,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:33:53,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:33:53,939 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:33:53,939 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:33:53,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:33:53,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:33:53,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:33:53,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:33:53,940 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2024-11-09 00:33:54,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:33:54,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:33:54,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:33:54,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:33:54,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:33:54,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:55,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:33:55,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:33:55,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:55,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0da2a2c/9fcb64f639de43ac8b04ab6e891529ba/FLAGd332374dd [2024-11-09 00:33:55,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0da2a2c/9fcb64f639de43ac8b04ab6e891529ba [2024-11-09 00:33:55,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:33:55,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:33:55,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:55,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:33:55,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:33:55,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb087d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55, skipping insertion in model container [2024-11-09 00:33:55,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:33:55,779 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_operatoramount_amount10_file-54.i[915,928] [2024-11-09 00:33:55,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:55,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:33:55,833 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_operatoramount_amount10_file-54.i[915,928] [2024-11-09 00:33:55,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:33:55,863 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:33:55,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55 WrapperNode [2024-11-09 00:33:55,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:33:55,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:55,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:33:55,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:33:55,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,896 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-09 00:33:55,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:33:55,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:33:55,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:33:55,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:33:55,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:33:55,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:33:55,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:33:55,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:33:55,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:33:55,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (1/1) ... [2024-11-09 00:33:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:33:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:33:55,982 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-09 00:33:55,988 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-09 00:33:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:33:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:33:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:33:56,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:33:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:33:56,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:33:56,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:33:56,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:33:57,588 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:33:57,589 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:33:57,600 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:33:57,602 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:33:57,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:57 BoogieIcfgContainer [2024-11-09 00:33:57,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:33:57,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:33:57,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:33:57,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:33:57,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:33:55" (1/3) ... [2024-11-09 00:33:57,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5624fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:57, skipping insertion in model container [2024-11-09 00:33:57,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:33:55" (2/3) ... [2024-11-09 00:33:57,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5624fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:33:57, skipping insertion in model container [2024-11-09 00:33:57,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:33:57" (3/3) ... [2024-11-09 00:33:57,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2024-11-09 00:33:57,620 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:33:57,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:33:57,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:33:57,669 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;@74c28696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:33:57,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:33:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:57,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:57,679 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:57,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 696913717, now seen corresponding path program 1 times [2024-11-09 00:33:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134303070] [2024-11-09 00:33:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:57,698 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-09 00:33:57,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:57,703 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-09 00:33:57,704 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-09 00:33:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:57,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:33:57,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 00:33:57,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:57,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134303070] [2024-11-09 00:33:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134303070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:57,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:33:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585828512] [2024-11-09 00:33:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:33:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:58,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:33:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:33:58,007 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:33:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:58,027 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2024-11-09 00:33:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:33:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-11-09 00:33:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:58,033 INFO L225 Difference]: With dead ends: 61 [2024-11-09 00:33:58,034 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 00:33:58,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 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-09 00:33:58,040 INFO L432 NwaCegarLoop]: 39 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, 39 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-09 00:33:58,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:33:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 00:33:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 00:33:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-09 00:33:58,086 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2024-11-09 00:33:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:58,087 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-09 00:33:58,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:33:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-09 00:33:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:58,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:58,090 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:58,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:33:58,291 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-09 00:33:58,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:58,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -469856391, now seen corresponding path program 1 times [2024-11-09 00:33:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254059648] [2024-11-09 00:33:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:58,293 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-09 00:33:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:58,294 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-09 00:33:58,295 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-09 00:33:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:58,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:33:58,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:58,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:58,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254059648] [2024-11-09 00:33:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254059648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:33:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504545689] [2024-11-09 00:33:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:58,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:33:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:33:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:33:58,596 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:59,140 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-11-09 00:33:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:33:59,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-11-09 00:33:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:59,155 INFO L225 Difference]: With dead ends: 57 [2024-11-09 00:33:59,155 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 00:33:59,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-09 00:33:59,157 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:59,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:33:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 00:33:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 00:33:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 00:33:59,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2024-11-09 00:33:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:59,162 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 00:33:59,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 00:33:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:59,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:59,164 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:59,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:33:59,364 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-09 00:33:59,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -412598089, now seen corresponding path program 1 times [2024-11-09 00:33:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551538745] [2024-11-09 00:33:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:59,367 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-09 00:33:59,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:59,369 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-09 00:33:59,370 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-09 00:33:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:59,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:33:59,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:34:42,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:34:42,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551538745] [2024-11-09 00:34:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551538745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:34:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941071799] [2024-11-09 00:34:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:34:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:34:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:34:42,587 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:35:00,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:35:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:00,171 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-09 00:35:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:35:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-11-09 00:35:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:00,207 INFO L225 Difference]: With dead ends: 38 [2024-11-09 00:35:00,207 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 00:35:00,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:35:00,209 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:00,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 126 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-11-09 00:35:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 00:35:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-09 00:35:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:35:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-09 00:35:00,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 56 [2024-11-09 00:35:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:00,217 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-09 00:35:00,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:35:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-09 00:35:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:35:00,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:00,219 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:35:00,229 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:35:00,420 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-09 00:35:00,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:00,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash -410751047, now seen corresponding path program 1 times [2024-11-09 00:35:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:00,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13724578] [2024-11-09 00:35:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:00,421 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-09 00:35:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:00,424 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-09 00:35:00,424 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-09 00:35:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:00,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:35:00,622 INFO L278 TraceCheckSpWp]: Computing forward predicates...